vector-0.13.1.0: Efficient Arrays
Copyright (c) Roman Leshchinskiy 2008-2010Alexey Kuleshevich 2020-2022Aleksey Khudyakov 2020-2022Andrew Lelechenko 2020-2022 BSD-style Haskell Libraries Team experimental non-portable Safe-Inferred Haskell2010

Data.Vector.Primitive

Description

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

Synopsis

# Primitive vectors

data Vector a Source #

Unboxed vectors of primitive types.

Constructors

 Vector Fields!Intoffset!Intlength!ByteArrayunderlying byte array

#### Instances

Instances details
 Source # Since: 0.12.1.0 Instance detailsDefined in Data.Vector.Primitive MethodsliftRnf :: (a -> ()) -> Vector a -> () # Prim a => Vector Vector a Source # Instance detailsDefined in Data.Vector.Primitive MethodsbasicUnsafeFreeze :: Mutable Vector s a -> ST s (Vector a) Source #basicUnsafeThaw :: Vector a -> ST s (Mutable Vector s a) Source #basicUnsafeSlice :: Int -> Int -> Vector a -> Vector a Source #basicUnsafeIndexM :: Vector a -> Int -> Box a Source #basicUnsafeCopy :: Mutable Vector s a -> Vector a -> ST s () Source #elemseq :: Vector a -> a -> b -> b Source # (Data a, Prim a) => Data (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive Methodsgfoldl :: (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 #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) # Prim a => Monoid (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive Methodsmappend :: Vector a -> Vector a -> Vector a #mconcat :: [Vector a] -> Vector a # Prim a => Semigroup (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive Methods(<>) :: Vector a -> Vector a -> Vector a #sconcat :: NonEmpty (Vector a) -> Vector a #stimes :: Integral b => b -> Vector a -> Vector a # Prim a => IsList (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive Associated Typestype Item (Vector a) # MethodsfromList :: [Item (Vector a)] -> Vector a #fromListN :: Int -> [Item (Vector a)] -> Vector a #toList :: Vector a -> [Item (Vector a)] # (Read a, Prim a) => Read (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive MethodsreadsPrec :: Int -> ReadS (Vector a) #readList :: ReadS [Vector a] # (Show a, Prim a) => Show (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive MethodsshowsPrec :: Int -> Vector a -> ShowS #show :: Vector a -> String #showList :: [Vector a] -> ShowS # NFData (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive Methodsrnf :: Vector a -> () # (Prim a, Eq a) => Eq (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive Methods(==) :: Vector a -> Vector a -> Bool #(/=) :: Vector a -> Vector a -> Bool # (Prim a, Ord a) => Ord (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive Methodscompare :: Vector a -> Vector a -> Ordering #(<) :: Vector a -> Vector a -> Bool #(<=) :: Vector a -> Vector a -> Bool #(>) :: Vector a -> Vector a -> Bool #(>=) :: Vector a -> Vector a -> Bool #max :: Vector a -> Vector a -> Vector a #min :: Vector a -> Vector a -> Vector a # type Mutable Vector Source # Instance detailsDefined in Data.Vector.Primitive type Mutable Vector = MVector type Item (Vector a) Source # Instance detailsDefined in Data.Vector.Primitive type Item (Vector a) = a

data MVector s a Source #

Mutable vectors of primitive types.

Constructors

 MVector Fields!Intoffset!Intlength!(MutableByteArray s)underlying mutable byte array

#### Instances

Instances details
 Prim a => MVector MVector a Source # Instance detailsDefined in Data.Vector.Primitive.Mutable MethodsbasicLength :: MVector s a -> Int Source #basicUnsafeSlice :: Int -> Int -> MVector s a -> MVector s a Source #basicOverlaps :: MVector s a -> MVector s a -> Bool Source #basicUnsafeNew :: Int -> ST s (MVector s a) Source #basicInitialize :: MVector s a -> ST s () Source #basicUnsafeReplicate :: Int -> a -> ST s (MVector s a) Source #basicUnsafeRead :: MVector s a -> Int -> ST s a Source #basicUnsafeWrite :: MVector s a -> Int -> a -> ST s () Source #basicClear :: MVector s a -> ST s () Source #basicSet :: MVector s a -> a -> ST s () Source #basicUnsafeCopy :: MVector s a -> MVector s a -> ST s () Source #basicUnsafeMove :: MVector s a -> MVector s a -> ST s () Source #basicUnsafeGrow :: MVector s a -> Int -> ST s (MVector s a) Source # Source # Instance detailsDefined in Data.Vector.Primitive.Mutable MethodsliftRnf :: (a -> ()) -> MVector s a -> () # NFData (MVector s a) Source # Instance detailsDefined in Data.Vector.Primitive.Mutable Methodsrnf :: MVector s a -> () #

# Accessors

## Length information

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

O(1) Yield the length of the vector.

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

O(1) Test whether a vector is empty.

## Indexing

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

O(1) Indexing.

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

O(1) Safe indexing.

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

O(1) First element.

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

O(1) Last element.

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

O(1) Unsafe indexing without bounds checking.

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

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

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

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

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

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 element) is evaluated eagerly.

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

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

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

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

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

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

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

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

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

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

## Extracting subvectors (slicing)

Arguments

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

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

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

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

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

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

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

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

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

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

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

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

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

Since: 0.7.1

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

O(1) Yield the head and tail of the vector, or Nothing if the vector is empty.

Since: 0.12.2.0

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

O(1) Yield the last and init of the vector, or Nothing if the vector is empty.

Since: 0.12.2.0

Arguments

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

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

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

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

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

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

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

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

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

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

# Construction

## Initialisation

empty :: Prim a => Vector a Source #

O(1) The empty vector.

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

O(1) A vector with exactly one element.

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

O(n) A vector of the given length with the same value in each position.

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

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

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

O(n) Apply the function $$\max(n - 1, 0)$$ times to an initial value, producing a vector of length $$\max(n, 0)$$. The 0th element will contain the initial value, which is 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

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.iterateN 0 undefined undefined :: VP.Vector Int
[]
>>> VP.iterateN 26 succ 'a'
"abcdefghijklmnopqrstuvwxyz"


Since: 0.7.1

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

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

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

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

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

O(n) Apply the monadic function $$\max(n - 1, 0)$$ times to an initial value, producing a vector of length $$\max(n, 0)$$. The 0th element will contain the initial value, which is why there is one less function application than the number of elements in the produced vector.

For a non-monadic version, see iterateN.

Since: 0.12.0.0

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

Execute the monadic action and freeze the resulting vector.

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


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

Execute the monadic action and freeze the resulting vectors.

## Unfolding

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

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

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

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

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

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

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

O(n) Construct a vector with exactly n elements by repeatedly applying the generator function to a seed. The generator function yields the next element and the new seed.

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

Since: 0.12.2.0

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

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

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

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

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

O(n) Construct a vector with exactly n elements by repeatedly applying the monadic generator function to a seed. The generator function yields the next element and the new seed.

Since: 0.12.2.0

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

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

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

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

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

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

## Enumeration

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

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

enumFromN 5 3 = <5,6,7>

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

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

enumFromStepN 1 2 5 = <1,3,5,7,9>

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

O(n) Enumerate values from x to y.

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

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

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

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

## Concatenation

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

O(n) Prepend an element.

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

O(n) Append an element.

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

O(m+n) Concatenate two vectors.

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

O(n) Concatenate all vectors in the list.

## Restricting memory usage

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

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

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

force (slice 0 2 <huge vector>)

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

# Modifying vectors

Arguments

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

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

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

Arguments

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

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

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

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

Same as (//), but without bounds checking.

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

Same as update_, but without bounds checking.

## Accumulations

Arguments

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

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

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.accum (+) (VP.fromList [1000,2000,3000 :: Int]) [(2,4),(1,6),(0,3),(1,10)]
[1003,2016,3004]


Arguments

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

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

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

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

Same as accum, but without bounds checking.

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

Same as accumulate_, but without bounds checking.

## Permutations

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

O(n) Reverse a vector.

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

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

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

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

Same as backpermute, but without bounds checking.

## Safe destructive updates

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

Apply a destructive operation to a vector. The operation may be performed in place if it is safe to do so and will modify a copy of the vector otherwise (see New for details).

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> import qualified Data.Vector.Primitive.Mutable as MVP
>>> VP.modify (\v -> MVP.write v 0 'x') $VP.replicate 4 'a' "xaaa"  # Elementwise operations ## Mapping map :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b Source # O(n) Map a function over a vector. imap :: (Prim a, Prim b) => (Int -> a -> b) -> Vector a -> Vector b Source # O(n) Apply a function to every element of a vector and its index. concatMap :: (Prim a, Prim b) => (a -> Vector b) -> Vector a -> Vector b Source # Map a function over a vector and concatenate the results. ## Monadic mapping mapM :: (Monad m, Prim a, Prim b) => (a -> m b) -> Vector a -> m (Vector b) Source # O(n) Apply the monadic action to all elements of the vector, yielding a vector of results. imapM :: (Monad m, Prim a, Prim b) => (Int -> a -> m b) -> Vector a -> m (Vector b) Source # O(n) Apply the monadic action to every element of a vector and its index, yielding a vector of results. Since: 0.12.2.0 mapM_ :: (Monad m, Prim a) => (a -> m b) -> Vector a -> m () Source # O(n) Apply the monadic action to all elements of a vector and ignore the results. imapM_ :: (Monad m, Prim a) => (Int -> a -> m b) -> Vector a -> m () Source # O(n) Apply the monadic action to every element of a vector and its index, ignoring the results. Since: 0.12.2.0 forM :: (Monad m, Prim a, Prim b) => Vector a -> (a -> m b) -> m (Vector b) Source # O(n) Apply the monadic action to all elements of the vector, yielding a vector of results. Equivalent to flip mapM. forM_ :: (Monad m, Prim a) => Vector a -> (a -> m b) -> m () Source # O(n) Apply the monadic action to all elements of a vector and ignore the results. Equivalent to flip mapM_. iforM :: (Monad m, Prim a, Prim b) => Vector a -> (Int -> a -> m b) -> m (Vector b) Source # O(n) Apply the monadic action to all elements of the vector and their indices, yielding a vector of results. Equivalent to flip imapM. Since: 0.12.2.0 iforM_ :: (Monad m, Prim a) => Vector a -> (Int -> a -> m b) -> m () Source # O(n) Apply the monadic action to all elements of the vector and their indices and ignore the results. Equivalent to flip imapM_. Since: 0.12.2.0 ## Zipping zipWith :: (Prim a, Prim b, Prim c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c Source # O(min(m,n)) Zip two vectors with the given function. zipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d Source # Zip three vectors with the given function. zipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e Source # zipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f Source # zipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g Source # izipWith :: (Prim a, Prim b, Prim c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c Source # O(min(m,n)) Zip two vectors with a function that also takes the elements' indices. izipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d Source # Zip three vectors and their indices with the given function. izipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e Source # izipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f Source # izipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g Source # ## Monadic zipping zipWithM :: (Monad m, Prim a, Prim b, Prim c) => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) Source # O(min(m,n)) Zip the two vectors with the monadic action and yield a vector of results. izipWithM :: (Monad m, Prim a, Prim b, Prim c) => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) Source # O(min(m,n)) Zip the two vectors with a monadic action that also takes the element index and yield a vector of results. Since: 0.12.2.0 zipWithM_ :: (Monad m, Prim a, Prim b) => (a -> b -> m c) -> Vector a -> Vector b -> m () Source # O(min(m,n)) Zip the two vectors with the monadic action and ignore the results. izipWithM_ :: (Monad m, Prim a, Prim b) => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m () Source # O(min(m,n)) Zip the two vectors with a monadic action that also takes the element index and ignore the results. Since: 0.12.2.0 # Working with predicates ## Filtering filter :: Prim a => (a -> Bool) -> Vector a -> Vector a Source # O(n) Drop all elements that do not satisfy the predicate. ifilter :: Prim a => (Int -> a -> Bool) -> Vector a -> Vector a Source # O(n) Drop all elements that do not satisfy the predicate which is applied to the values and their indices. filterM :: (Monad m, Prim a) => (a -> m Bool) -> Vector a -> m (Vector a) Source # O(n) Drop all elements that do not satisfy the monadic predicate. uniq :: (Prim a, Eq a) => Vector a -> Vector a Source # O(n) Drop repeated adjacent elements. The first element in each group is returned. #### Examples Expand >>> import qualified Data.Vector.Primitive as VP >>> VP.uniq$ VP.fromList [1,3,3,200,3 :: Int]
[1,3,200,3]


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

O(n) Map the values and collect the Just results.

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

O(n) Map the indices/values and collect the Just results.

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

O(n) Apply the monadic function to each element of the vector and discard elements returning Nothing.

Since: 0.12.2.0

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

O(n) Apply the monadic function to each element of the vector and its index. Discard elements returning Nothing.

Since: 0.12.2.0

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

O(n) Yield the longest prefix of elements satisfying the predicate. The current implementation is not copy-free, unless the result vector is fused away.

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

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

## Partitioning

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

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

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

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

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

O(n) Split the vector into two parts, the first one containing the Left elements and the second containing the Right elements. The relative order of the elements is preserved.

Since: 0.12.1.0

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

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

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

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

groupBy :: Prim a => (a -> a -> Bool) -> Vector a -> [Vector a] Source #

O(n) Split a vector into a list of slices, using a predicate function.

The concatenation of this list of slices is equal to the argument vector, and each slice contains only equal elements, as determined by the equality predicate function.

Does not fuse.

>>> import qualified Data.Vector.Primitive as VP
>>> import           Data.Char (isUpper)
>>> VP.groupBy (\a b -> isUpper a == isUpper b) (VP.fromList "Mississippi River")
["M","ississippi ","R","iver"]


See also groupBy, group.

Since: 0.13.0.1

group :: (Prim a, Eq a) => Vector a -> [Vector a] Source #

O(n) Split a vector into a list of slices of the input vector.

The concatenation of this list of slices is equal to the argument vector, and each slice contains only equal elements.

Does not fuse.

This is the equivalent of 'groupBy (==)'.

>>> import qualified Data.Vector.Primitive as VP
>>> VP.group (VP.fromList "Mississippi")
["M","i","ss","i","ss","i","pp","i"]


See also group.

Since: 0.13.0.1

## Searching

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

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

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

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

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

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

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

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

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

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

Does not fuse.

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

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

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

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

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

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

# Folding

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

O(n) Left fold.

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

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

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

O(n) Left fold with strict accumulator.

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

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

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

O(n) Right fold.

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

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

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

O(n) Right fold with a strict accumulator.

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

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

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

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

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

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

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

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

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

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

foldMap :: (Monoid m, Prim a) => (a -> m) -> Vector a -> m Source #

O(n) Map each element of the structure to a monoid and combine the results. It uses the same implementation as the corresponding method of the Foldable type cless. Note that it's implemented in terms of foldr and won't fuse with functions that traverse the vector from left to right (map, generate, etc.).

Since: 0.12.2.0

foldMap' :: (Monoid m, Prim a) => (a -> m) -> Vector a -> m Source #

O(n) Like foldMap, but strict in the accumulator. It uses the same implementation as the corresponding method of the Foldable type class. Note that it's implemented in terms of foldl', so it fuses in most contexts.

Since: 0.12.2.0

## Specialised folds

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

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

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.all even $VP.fromList [2, 4, 12 :: Int] True >>> VP.all even$ VP.fromList [2, 4, 13 :: Int]
False
>>> VP.all even (VP.empty :: VP.Vector Int)
True


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

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

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.any even $VP.fromList [1, 3, 7 :: Int] False >>> VP.any even$ VP.fromList [3, 2, 13 :: Int]
True
>>> VP.any even (VP.empty :: VP.Vector Int)
False


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

O(n) Compute the sum of the elements.

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.sum $VP.fromList [300,20,1 :: Int] 321 >>> VP.sum (VP.empty :: VP.Vector Int) 0  product :: (Prim a, Num a) => Vector a -> a Source # O(n) Compute the product of the elements. #### Examples Expand >>> import qualified Data.Vector.Primitive as VP >>> VP.product$ VP.fromList [1,2,3,4 :: Int]
24
>>> VP.product (VP.empty :: VP.Vector Int)
1


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

O(n) Yield the maximum element of the vector. The vector may not be empty. In case of a tie, the first occurrence wins.

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.maximum $VP.fromList [2, 1 :: Int] 2  maximumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a Source # O(n) Yield the maximum element of the vector according to the given comparison function. The vector may not be empty. In case of a tie, the first occurrence wins. This behavior is different from maximumBy which returns the last tie. maximumOn :: (Ord b, Prim a) => (a -> b) -> Vector a -> a Source # O(n) Yield the maximum element of the vector by comparing the results of a key function on each element. In case of a tie, the first occurrence wins. The vector may not be empty. Since: 0.13.0.0 minimum :: (Prim a, Ord a) => Vector a -> a Source # O(n) Yield the minimum element of the vector. The vector may not be empty. In case of a tie, the first occurrence wins. #### Examples Expand >>> import qualified Data.Vector.Primitive as VP >>> VP.minimum$ VP.fromList [2, 1 :: Int]
1


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

O(n) Yield the minimum element of the vector according to the given comparison function. The vector may not be empty. In case of a tie, the first occurrence wins.

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

O(n) Yield the minimum element of the vector by comparing the results of a key function on each element. In case of a tie, the first occurrence wins. The vector may not be empty.

Since: 0.13.0.0

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

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

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

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

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

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

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

O(n) Yield the index of the maximum element of the vector according to the given comparison function. The vector may not be empty. In case of a tie, the first occurrence wins.

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

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

O(n) Monadic fold using a function applied to each element and its index.

Since: 0.12.2.0

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

O(n) Monadic fold with strict accumulator.

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

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

Since: 0.12.2.0

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

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

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

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

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

O(n) Monadic fold that discards the result.

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

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

Since: 0.12.2.0

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

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

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

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

Since: 0.12.2.0

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

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

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

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

# Scans

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

O(n) Left-to-right prescan.

prescanl f z = init . scanl f z


#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.prescanl (+) 0 (VP.fromList [1,2,3,4 :: Int])
[0,1,3,6]


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

O(n) Left-to-right prescan with strict accumulator.

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

O(n) Left-to-right postscan.

postscanl f z = tail . scanl f z


#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.postscanl (+) 0 (VP.fromList [1,2,3,4 :: Int])
[1,3,6,10]


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

O(n) Left-to-right postscan with strict accumulator.

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

O(n) Left-to-right scan.

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

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.scanl (+) 0 (VP.fromList [1,2,3,4 :: Int])
[0,1,3,6,10]


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

O(n) Left-to-right scan with strict accumulator.

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

O(n) Initial-value free left-to-right scan over a vector.

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

Note: Since 0.13, application of this to an empty vector no longer results in an error; instead it produces an empty vector.

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.scanl1 min $VP.fromListN 5 [4,2,4,1,3 :: Int] [4,2,2,1,1] >>> VP.scanl1 max$ VP.fromListN 5 [1,3,2,5,4 :: Int]
[1,3,3,5,5]
>>> VP.scanl1 min (VP.empty :: VP.Vector Int)
[]


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

O(n) Initial-value free left-to-right scan over a vector with a strict accumulator.

Note: Since 0.13, application of this to an empty vector no longer results in an error; instead it produces an empty vector.

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.scanl1' min $VP.fromListN 5 [4,2,4,1,3 :: Int] [4,2,2,1,1] >>> VP.scanl1' max$ VP.fromListN 5 [1,3,2,5,4 :: Int]
[1,3,3,5,5]
>>> VP.scanl1' min (VP.empty :: VP.Vector Int)
[]


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

O(n) Left-to-right scan over a vector with its index.

Since: 0.12.2.0

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

O(n) Left-to-right scan over a vector (strictly) with its index.

Since: 0.12.2.0

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

O(n) Right-to-left prescan.

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


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

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

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

O(n) Right-to-left postscan.

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

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

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

O(n) Right-to-left scan.

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

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

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

O(n) Right-to-left, initial-value free scan over a vector.

Note: Since 0.13, application of this to an empty vector no longer results in an error; instead it produces an empty vector.

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.scanr1 min $VP.fromListN 5 [3,1,4,2,4 :: Int] [1,1,2,2,4] >>> VP.scanr1 max$ VP.fromListN 5 [4,5,2,3,1 :: Int]
[5,5,3,3,1]
>>> VP.scanr1 min (VP.empty :: VP.Vector Int)
[]


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

O(n) Right-to-left, initial-value free scan over a vector with a strict accumulator.

Note: Since 0.13, application of this to an empty vector no longer results in an error; instead it produces an empty vector.

#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.scanr1' min $VP.fromListN 5 [3,1,4,2,4 :: Int] [1,1,2,2,4] >>> VP.scanr1' max$ VP.fromListN 5 [4,5,2,3,1 :: Int]
[5,5,3,3,1]
>>> VP.scanr1' min (VP.empty :: VP.Vector Int)
[]


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

O(n) Right-to-left scan over a vector with its index.

Since: 0.12.2.0

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

O(n) Right-to-left scan over a vector (strictly) with its index.

Since: 0.12.2.0

## Comparisons

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

O(n) Check if two vectors are equal using the supplied equality predicate.

Since: 0.12.2.0

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

O(n) Compare two vectors using the supplied comparison function for vector elements. Comparison works the same as for lists.

cmpBy compare == compare

Since: 0.12.2.0

# Conversions

## Lists

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

O(n) Convert a vector to a list.

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

O(n) Convert a list to a vector.

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

O(n) Convert the first n elements of a list to a vector. It's expected that the supplied list will be exactly n elements long. As an optimization, this function allocates a buffer for n elements, which could be used for DoS-attacks by exhausting the memory if an attacker controls that parameter.

fromListN n xs = fromList (take n xs)


#### Examples

Expand
>>> import qualified Data.Vector.Primitive as VP
>>> VP.fromListN 3 [1,2,3,4,5 :: Int]
[1,2,3]
>>> VP.fromListN 3 [1 :: Int]
[1]


## Other vector types

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

O(n) Convert between different vector types.

unsafeCast :: forall a b. (HasCallStack, Prim a, Prim b) => Vector a -> Vector b Source #

O(1) Unsafely cast a vector from one element type to another. This operation just changes the type of the vector and does not modify the elements.

This function will throw an error if elements are of mismatching sizes.

| @since 0.13.0.0

unsafeCoerceVector :: Coercible a b => Vector a -> Vector b Source #

O(1) Unsafely coerce an immutable vector from one element type to another, representationally equal type. The operation just changes the type of the underlying pointer and does not modify the elements.

This is marginally safer than unsafeCast, since this function imposes an extra Coercible constraint. The constraint guarantees that the element types are representationally equal. It however cannot guarantee that their respective Prim instances are compatible.

## Mutable vectors

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

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

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

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

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

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

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

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

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

O(1) Unsafely convert an immutable vector to a mutable one without copying. Note that this is a very dangerous function and generally it's only safe to read from the resulting vector. In this case, the immutable vector could be used safely as well.

Problems with mutation happen because GHC has a lot of freedom to introduce sharing. As a result mutable vectors produced by unsafeThaw may or may not share the same underlying buffer. For example:

foo = do
let vec = V.generate 10 id
mvec <- V.unsafeThaw vec
do_something mvec

Here GHC could lift vec outside of foo which means that all calls to do_something will use same buffer with possibly disastrous results. Whether such aliasing happens or not depends on the program in question, optimization levels, and GHC flags.

All in all, attempts to modify a vector produced by unsafeThaw fall out of domain of software engineering and into realm of black magic, dark rituals, and unspeakable horrors. The only advice that could be given is: "Don't attempt to mutate a vector produced by unsafeThaw unless you know how to prevent GHC from aliasing buffers accidentally. We don't."

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

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

## Re-exports

class Prim a #

Class of types supporting primitive array operations. This includes interfacing with GC-managed memory (functions suffixed with ByteArray#) and interfacing with unmanaged memory (functions suffixed with Addr#). Endianness is platform-dependent.

Minimal complete definition

#### Instances

Instances details