| Copyright | (c) Roman Leshchinskiy 2008-2010 |
|---|---|
| License | BSD-style |
| Maintainer | Roman Leshchinskiy <rl@cse.unsw.edu.au> |
| Stability | experimental |
| Portability | non-portable |
| Safe Haskell | None |
| Language | 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
- data Vector a = Vector ! Int ! Int ! ByteArray
- data MVector s a = MVector ! Int ! Int !( MutableByteArray s)
- class Prim a
- length :: Prim a => Vector a -> Int
- null :: Prim a => Vector a -> Bool
- (!) :: Prim a => Vector a -> Int -> a
- (!?) :: Prim a => Vector a -> Int -> Maybe a
- head :: Prim a => Vector a -> a
- last :: Prim a => Vector a -> a
- unsafeIndex :: Prim a => Vector a -> Int -> a
- unsafeHead :: Prim a => Vector a -> a
- unsafeLast :: Prim a => Vector a -> a
- indexM :: ( Prim a, Monad m) => Vector a -> Int -> m a
- headM :: ( Prim a, Monad m) => Vector a -> m a
- lastM :: ( Prim a, Monad m) => Vector a -> m a
- unsafeIndexM :: ( Prim a, Monad m) => Vector a -> Int -> m a
- unsafeHeadM :: ( Prim a, Monad m) => Vector a -> m a
- unsafeLastM :: ( Prim a, Monad m) => Vector a -> m a
- slice :: Prim a => Int -> Int -> Vector a -> Vector a
- init :: Prim a => Vector a -> Vector a
- tail :: Prim a => Vector a -> Vector a
- take :: Prim a => Int -> Vector a -> Vector a
- drop :: Prim a => Int -> Vector a -> Vector a
- splitAt :: Prim a => Int -> Vector a -> ( Vector a, Vector a)
- uncons :: Prim a => Vector a -> Maybe (a, Vector a)
- unsnoc :: Prim a => Vector a -> Maybe ( Vector a, a)
- unsafeSlice :: Prim a => Int -> Int -> Vector a -> Vector a
- unsafeInit :: Prim a => Vector a -> Vector a
- unsafeTail :: Prim a => Vector a -> Vector a
- unsafeTake :: Prim a => Int -> Vector a -> Vector a
- unsafeDrop :: Prim a => Int -> Vector a -> Vector a
- empty :: Prim a => Vector a
- singleton :: Prim a => a -> Vector a
- replicate :: Prim a => Int -> a -> Vector a
- generate :: Prim a => Int -> ( Int -> a) -> Vector a
- iterateN :: Prim a => Int -> (a -> a) -> a -> Vector a
- replicateM :: ( Monad m, Prim a) => Int -> m a -> m ( Vector a)
- generateM :: ( Monad m, Prim a) => Int -> ( Int -> m a) -> m ( Vector a)
- iterateNM :: ( Monad m, Prim a) => Int -> (a -> m a) -> a -> m ( Vector a)
- create :: Prim a => ( forall s. ST s ( MVector s a)) -> Vector a
- createT :: ( Traversable f, Prim a) => ( forall s. ST s (f ( MVector s a))) -> f ( Vector a)
- unfoldr :: Prim a => (b -> Maybe (a, b)) -> b -> Vector a
- unfoldrN :: Prim a => Int -> (b -> Maybe (a, b)) -> b -> Vector a
- unfoldrExactN :: Prim a => Int -> (b -> (a, b)) -> b -> Vector a
- unfoldrM :: ( Monad m, Prim a) => (b -> m ( Maybe (a, b))) -> b -> m ( Vector a)
- unfoldrNM :: ( Monad m, Prim a) => Int -> (b -> m ( Maybe (a, b))) -> b -> m ( Vector a)
- unfoldrExactNM :: ( Monad m, Prim a) => Int -> (b -> m (a, b)) -> b -> m ( Vector a)
- constructN :: Prim a => Int -> ( Vector a -> a) -> Vector a
- constructrN :: Prim a => Int -> ( Vector a -> a) -> Vector a
- enumFromN :: ( Prim a, Num a) => a -> Int -> Vector a
- enumFromStepN :: ( Prim a, Num a) => a -> a -> Int -> Vector a
- enumFromTo :: ( Prim a, Enum a) => a -> a -> Vector a
- enumFromThenTo :: ( Prim a, Enum a) => a -> a -> a -> Vector a
- cons :: Prim a => a -> Vector a -> Vector a
- snoc :: Prim a => Vector a -> a -> Vector a
- (++) :: Prim a => Vector a -> Vector a -> Vector a
- concat :: Prim a => [ Vector a] -> Vector a
- force :: Prim a => Vector a -> Vector a
- (//) :: Prim a => Vector a -> [( Int , a)] -> Vector a
- update_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a
- unsafeUpd :: Prim a => Vector a -> [( Int , a)] -> Vector a
- unsafeUpdate_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a
- accum :: Prim a => (a -> b -> a) -> Vector a -> [( Int , b)] -> Vector a
- accumulate_ :: ( Prim a, Prim b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
- unsafeAccum :: Prim a => (a -> b -> a) -> Vector a -> [( Int , b)] -> Vector a
- unsafeAccumulate_ :: ( Prim a, Prim b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
- reverse :: Prim a => Vector a -> Vector a
- backpermute :: Prim a => Vector a -> Vector Int -> Vector a
- unsafeBackpermute :: Prim a => Vector a -> Vector Int -> Vector a
- modify :: Prim a => ( forall s. MVector s a -> ST s ()) -> Vector a -> Vector a
- map :: ( Prim a, Prim b) => (a -> b) -> Vector a -> Vector b
- imap :: ( Prim a, Prim b) => ( Int -> a -> b) -> Vector a -> Vector b
- concatMap :: ( Prim a, Prim b) => (a -> Vector b) -> Vector a -> Vector b
- mapM :: ( Monad m, Prim a, Prim b) => (a -> m b) -> Vector a -> m ( Vector b)
- imapM :: ( Monad m, Prim a, Prim b) => ( Int -> a -> m b) -> Vector a -> m ( Vector b)
- mapM_ :: ( Monad m, Prim a) => (a -> m b) -> Vector a -> m ()
- imapM_ :: ( Monad m, Prim a) => ( Int -> a -> m b) -> Vector a -> m ()
- forM :: ( Monad m, Prim a, Prim b) => Vector a -> (a -> m b) -> m ( Vector b)
- forM_ :: ( Monad m, Prim a) => Vector a -> (a -> m b) -> m ()
- iforM :: ( Monad m, Prim a, Prim b) => Vector a -> ( Int -> a -> m b) -> m ( Vector b)
- iforM_ :: ( Monad m, Prim a) => Vector a -> ( Int -> a -> m b) -> m ()
- zipWith :: ( Prim a, Prim b, Prim c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c
- zipWith3 :: ( Prim a, Prim b, Prim c, Prim d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
- 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
- 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
- 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
- izipWith :: ( Prim a, Prim b, Prim c) => ( Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c
- izipWith3 :: ( Prim a, Prim b, Prim c, Prim d) => ( Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
- 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
- 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
- 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
- zipWithM :: ( Monad m, Prim a, Prim b, Prim c) => (a -> b -> m c) -> Vector a -> Vector b -> m ( Vector c)
- izipWithM :: ( Monad m, Prim a, Prim b, Prim c) => ( Int -> a -> b -> m c) -> Vector a -> Vector b -> m ( Vector c)
- zipWithM_ :: ( Monad m, Prim a, Prim b) => (a -> b -> m c) -> Vector a -> Vector b -> m ()
- izipWithM_ :: ( Monad m, Prim a, Prim b) => ( Int -> a -> b -> m c) -> Vector a -> Vector b -> m ()
- filter :: Prim a => (a -> Bool ) -> Vector a -> Vector a
- ifilter :: Prim a => ( Int -> a -> Bool ) -> Vector a -> Vector a
- filterM :: ( Monad m, Prim a) => (a -> m Bool ) -> Vector a -> m ( Vector a)
- uniq :: ( Prim a, Eq a) => Vector a -> Vector a
- mapMaybe :: ( Prim a, Prim b) => (a -> Maybe b) -> Vector a -> Vector b
- imapMaybe :: ( Prim a, Prim b) => ( Int -> a -> Maybe b) -> Vector a -> Vector b
- mapMaybeM :: ( Monad m, Prim a, Prim b) => (a -> m ( Maybe b)) -> Vector a -> m ( Vector b)
- imapMaybeM :: ( Monad m, Prim a, Prim b) => ( Int -> a -> m ( Maybe b)) -> Vector a -> m ( Vector b)
- takeWhile :: Prim a => (a -> Bool ) -> Vector a -> Vector a
- dropWhile :: Prim a => (a -> Bool ) -> Vector a -> Vector a
- partition :: Prim a => (a -> Bool ) -> Vector a -> ( Vector a, Vector a)
- unstablePartition :: Prim a => (a -> Bool ) -> Vector a -> ( Vector a, Vector a)
- partitionWith :: ( Prim a, Prim b, Prim c) => (a -> Either b c) -> Vector a -> ( Vector b, Vector c)
- span :: Prim a => (a -> Bool ) -> Vector a -> ( Vector a, Vector a)
- break :: Prim a => (a -> Bool ) -> Vector a -> ( Vector a, Vector a)
- elem :: ( Prim a, Eq a) => a -> Vector a -> Bool
- notElem :: ( Prim a, Eq a) => a -> Vector a -> Bool
- find :: Prim a => (a -> Bool ) -> Vector a -> Maybe a
- findIndex :: Prim a => (a -> Bool ) -> Vector a -> Maybe Int
- findIndices :: Prim a => (a -> Bool ) -> Vector a -> Vector Int
- elemIndex :: ( Prim a, Eq a) => a -> Vector a -> Maybe Int
- elemIndices :: ( Prim a, Eq a) => a -> Vector a -> Vector Int
- foldl :: Prim b => (a -> b -> a) -> a -> Vector b -> a
- foldl1 :: Prim a => (a -> a -> a) -> Vector a -> a
- foldl' :: Prim b => (a -> b -> a) -> a -> Vector b -> a
- foldl1' :: Prim a => (a -> a -> a) -> Vector a -> a
- foldr :: Prim a => (a -> b -> b) -> b -> Vector a -> b
- foldr1 :: Prim a => (a -> a -> a) -> Vector a -> a
- foldr' :: Prim a => (a -> b -> b) -> b -> Vector a -> b
- foldr1' :: Prim a => (a -> a -> a) -> Vector a -> a
- ifoldl :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a
- ifoldl' :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a
- ifoldr :: Prim a => ( Int -> a -> b -> b) -> b -> Vector a -> b
- ifoldr' :: Prim a => ( Int -> a -> b -> b) -> b -> Vector a -> b
- foldMap :: ( Monoid m, Prim a) => (a -> m) -> Vector a -> m
- foldMap' :: ( Monoid m, Prim a) => (a -> m) -> Vector a -> m
- all :: Prim a => (a -> Bool ) -> Vector a -> Bool
- any :: Prim a => (a -> Bool ) -> Vector a -> Bool
- sum :: ( Prim a, Num a) => Vector a -> a
- product :: ( Prim a, Num a) => Vector a -> a
- maximum :: ( Prim a, Ord a) => Vector a -> a
- maximumBy :: Prim a => (a -> a -> Ordering ) -> Vector a -> a
- minimum :: ( Prim a, Ord a) => Vector a -> a
- minimumBy :: Prim a => (a -> a -> Ordering ) -> Vector a -> a
- minIndex :: ( Prim a, Ord a) => Vector a -> Int
- minIndexBy :: Prim a => (a -> a -> Ordering ) -> Vector a -> Int
- maxIndex :: ( Prim a, Ord a) => Vector a -> Int
- maxIndexBy :: Prim a => (a -> a -> Ordering ) -> Vector a -> Int
- foldM :: ( Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a
- ifoldM :: ( Monad m, Prim b) => (a -> Int -> b -> m a) -> a -> Vector b -> m a
- foldM' :: ( Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a
- ifoldM' :: ( Monad m, Prim b) => (a -> Int -> b -> m a) -> a -> Vector b -> m a
- fold1M :: ( Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a
- fold1M' :: ( Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a
- foldM_ :: ( Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m ()
- ifoldM_ :: ( Monad m, Prim b) => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
- foldM'_ :: ( Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m ()
- ifoldM'_ :: ( Monad m, Prim b) => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
- fold1M_ :: ( Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m ()
- fold1M'_ :: ( Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m ()
- prescanl :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
- prescanl' :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
- postscanl :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
- postscanl' :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
- scanl :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
- scanl' :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
- scanl1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a
- scanl1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a
- iscanl :: ( Prim a, Prim b) => ( Int -> a -> b -> a) -> a -> Vector b -> Vector a
- iscanl' :: ( Prim a, Prim b) => ( Int -> a -> b -> a) -> a -> Vector b -> Vector a
- prescanr :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
- prescanr' :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
- postscanr :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
- postscanr' :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
- scanr :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
- scanr' :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
- scanr1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a
- scanr1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a
- iscanr :: ( Prim a, Prim b) => ( Int -> a -> b -> b) -> b -> Vector a -> Vector b
- iscanr' :: ( Prim a, Prim b) => ( Int -> a -> b -> b) -> b -> Vector a -> Vector b
- eqBy :: ( Prim a, Prim b) => (a -> b -> Bool ) -> Vector a -> Vector b -> Bool
- cmpBy :: ( Prim a, Prim b) => (a -> b -> Ordering ) -> Vector a -> Vector b -> Ordering
- toList :: Prim a => Vector a -> [a]
- fromList :: Prim a => [a] -> Vector a
- fromListN :: Prim a => Int -> [a] -> Vector a
- convert :: ( Vector v a, Vector w a) => v a -> w a
- freeze :: ( Prim a, PrimMonad m) => MVector ( PrimState m) a -> m ( Vector a)
- thaw :: ( Prim a, PrimMonad m) => Vector a -> m ( MVector ( PrimState m) a)
- copy :: ( Prim a, PrimMonad m) => MVector ( PrimState m) a -> Vector a -> m ()
- unsafeFreeze :: ( Prim a, PrimMonad m) => MVector ( PrimState m) a -> m ( Vector a)
- unsafeThaw :: ( Prim a, PrimMonad m) => Vector a -> m ( MVector ( PrimState m) a)
- unsafeCopy :: ( Prim a, PrimMonad m) => MVector ( PrimState m) a -> Vector a -> m ()
Primitive vectors
Unboxed vectors of primitive types
Instances
| NFData1 Vector Source # |
Since: 0.12.1.0 |
|
Defined in Data.Vector.Primitive |
|
| Prim a => Vector Vector a Source # | |
|
Defined in Data.Vector.Primitive Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector ( PrimState m) a -> m ( Vector a) Source # basicUnsafeThaw :: PrimMonad m => Vector a -> m ( Mutable Vector ( PrimState m) a) Source # basicLength :: Vector a -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector a -> Vector a Source # basicUnsafeIndexM :: Monad m => Vector a -> Int -> m a Source # basicUnsafeCopy :: PrimMonad m => Mutable Vector ( PrimState m) a -> Vector a -> m () Source # |
|
| Prim a => IsList ( Vector a) Source # | |
| ( Prim a, Eq a) => Eq ( Vector a) Source # | |
| ( Data a, Prim a) => Data ( Vector a) Source # | |
|
Defined in Data.Vector.Primitive Methods gfoldl :: ( forall d b. Data d => c (d -> b) -> d -> c b) -> ( forall g. g -> c g) -> Vector a -> c ( Vector a) Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c ( Vector a) Source # toConstr :: Vector a -> Constr Source # dataTypeOf :: Vector a -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c ( Vector a)) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c ( Vector a)) Source # gmapT :: ( forall b. Data b => b -> b) -> Vector a -> Vector a Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> Vector a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> Vector a -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> Vector a -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> Vector a -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> Vector a -> m ( Vector a) Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> Vector a -> m ( Vector a) Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> Vector a -> m ( Vector a) Source # |
|
| ( Prim a, Ord a) => Ord ( Vector a) Source # | |
|
Defined in Data.Vector.Primitive |
|
| ( Read a, Prim a) => Read ( Vector a) Source # | |
| ( Show a, Prim a) => Show ( Vector a) Source # | |
| Prim a => Semigroup ( Vector a) Source # | |
| Prim a => Monoid ( Vector a) Source # | |
| NFData ( Vector a) Source # | |
|
Defined in Data.Vector.Primitive |
|
| type Mutable Vector Source # | |
|
Defined in Data.Vector.Primitive |
|
| type Item ( Vector a) Source # | |
|
Defined in Data.Vector.Primitive |
|
Mutable vectors of primitive types.
Constructors
| MVector ! Int ! Int !( MutableByteArray s) |
offset, length, underlying mutable byte array |
Instances
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
sizeOf# , alignment# , indexByteArray# , readByteArray# , writeByteArray# , setByteArray# , indexOffAddr# , readOffAddr# , writeOffAddr# , setOffAddr#
Instances
Accessors
Length information
Indexing
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
Monadic indexing
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
elements) 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)
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.
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
replicate :: Prim a => Int -> a -> Vector a Source #
O(n) 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 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.Primitive as VP>>>VP.iterateN 0 undefined undefined :: VP.Vector Int[]>>>VP.iterateN 26 succ 'a'"abcdefghijklmnopqrstuvwxyz"
Since: 0.7.1
Monadic initialisation
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 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: 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
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
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 0.1 5 = <1,1.1,1.2,1.3,1.4>
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 at all 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 at all possible, use
enumFromStepN
instead.
Concatenation
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
Bulk updates
Arguments
| :: Prim a | |
| => Vector a |
initial vector (of length
|
| -> [( Int , a)] |
list of index/value pairs (of length
|
| -> 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>
Arguments
| :: Prim a | |
| => Vector a |
initial vector (of length
|
| -> Vector Int |
index vector (of length
|
| -> Vector a |
value vector (of length
|
| -> 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
|
| -> Vector a |
initial vector (of length
|
| -> [( Int , b)] |
list of index/value pairs (of length
|
| -> 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
>>>import qualified Data.Vector.Primitive as VP>>>VP.accum (+) (VP.fromList [1000.0,2000.0,3000.0]) [(2,4),(1,6),(0,3),(1,10)][1003.0,2016.0,3004.0]
Arguments
| :: ( Prim a, Prim b) | |
| => (a -> b -> a) |
accumulating function
|
| -> Vector a |
initial vector (of length
|
| -> Vector Int |
index vector (of length
|
| -> Vector b |
value vector (of length
|
| -> 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
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 will be performed in place if it is safe to do so and will modify a copy of the vector otherwise.
modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
Elementwise operations
Mapping
map :: ( 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_
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 elements that do not satisfy the predicate
ifilter :: Prim a => ( Int -> a -> Bool ) -> Vector a -> Vector a Source #
O(n) Drop elements that do not satisfy the predicate which is applied to values and their indices
filterM :: ( Monad m, Prim a) => (a -> m Bool ) -> Vector a -> m ( Vector a) Source #
O(n) Drop elements that do not satisfy the monadic predicate
mapMaybe :: ( Prim a, Prim b) => (a -> Maybe b) -> Vector a -> Vector b Source #
O(n) Drop elements when predicate returns Nothing
imapMaybe :: ( Prim a, Prim b) => ( Int -> a -> Maybe b) -> Vector a -> Vector b Source #
O(n) Drop elements when predicate, applied to index and value, returns Nothing
mapMaybeM :: ( Monad m, Prim a, Prim b) => (a -> m ( Maybe b)) -> Vector a -> m ( Vector b) Source #
O(n) Apply monadic function to each element of 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 monadic function to each element of vector and its index. Discards 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. 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 #
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.
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
)
findIndices :: Prim a => (a -> Bool ) -> Vector a -> Vector Int Source #
O(n) Yield the indices of elements satisfying the predicate in ascending order.
elemIndices :: ( Prim a, Eq a) => a -> Vector a -> Vector Int Source #
O(n)
Yield the indices of all occurences 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 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 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 (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 (function applied to each element and its index)
ifoldr :: Prim a => ( Int -> a -> b -> b) -> b -> Vector a -> b Source #
O(n) Right fold (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 (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 same implementation as corresponding method of
Foldable
type cless. Note it's implemented in terms of
foldr
and won't fuse with functions that traverse vector from left to
right (
map
,
generate
, etc.).
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
>>>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
>>>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
>>>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 produce of the elements
Examples
>>>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.
Examples
>>>import qualified Data.Vector.Primitive as VP>>>VP.maximum $ VP.fromList [2.0, 1.0]2.0
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.
minimum :: ( Prim a, Ord a) => Vector a -> a Source #
O(n) Yield the minimum element of the vector. The vector may not be empty.
Examples
>>>import qualified Data.Vector.Primitive as VP>>>VP.minimum $ VP.fromList [2.0, 1.0]1.0
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.
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.
Monadic folds
ifoldM :: ( Monad m, Prim b) => (a -> Int -> b -> m a) -> a -> Vector b -> m a Source #
O(n) Monadic fold (action 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 (action 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 (action 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 (action 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
Prefix sums (scans)
prescanl' :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #
O(n) Prescan with strict accumulator
postscanl' :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #
O(n) Scan with strict accumulator
scanl :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #
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' :: ( Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a Source #
O(n) Haskell-style scan with strict accumulator
scanl1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a Source #
O(n) Scan over a non-empty vector
scanl f <x1,...,xn> = <y1,...,yn>
where y1 = x1
yi = f y(i-1) xi
scanl1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a Source #
O(n) Scan over a non-empty vector with a strict accumulator
iscanl :: ( Prim a, Prim b) => ( Int -> a -> b -> a) -> a -> Vector b -> Vector a Source #
O(n) 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) 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 with strict accumulator
postscanr :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #
O(n) Right-to-left scan
postscanr' :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #
O(n) Right-to-left scan with strict accumulator
scanr :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #
O(n) Right-to-left Haskell-style scan
scanr' :: ( Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b Source #
O(n) Right-to-left Haskell-style scan with strict accumulator
scanr1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a Source #
O(n) Right-to-left scan over a non-empty vector
scanr1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a Source #
O(n) Right-to-left scan over a non-empty vector with a strict accumulator
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 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 supplied comparison function for vector elements. Comparison works same as for lists.
cmpBy compare == compare
Since: 0.12.2.0
Conversions
Lists
Other vector types
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 the 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) Unsafe 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 very dangerous function and generally it's only safe to read from resulting vector. In which case immutable vector could be used safely as well.
Problem with mutation happens because GHC has a lot of freedom to
introduce sharing. As a result mutable vectors produced by
unsafeThaw
may or may not share 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 all calls to
do_something
will use same buffer with possibly disastrous
results. Whether such aliasing happens or not depends on program in
question, optimization levels, and GHC flags.
All in all attempts to modify vector after unsafeThaw falls out of domain of software engineering and into realm of black magic, dark rituals, and unspeakable horrors. Only advice that could be given is: "don't attempt to mutate vector after unsafeThaw unless you know how to prevent GHC from aliasing buffers accidentally. We don't"