Data.Vector.Unboxed.Mutable.Sized

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

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

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

Documentation

type MVector = MVector MVector

Vector specialized to use Mutable.

Accessors

Length information

length :: forall n s a. KnownNat n => MVector n s a -> Int

O(1) Yield the length of the mutable vector as an Int.

length' :: forall n s a. MVector n s a -> Proxy n

O(1) Yield the length of the mutable vector as a Proxy.

null :: forall n s a. KnownNat n => MVector n s a -> Bool

O(1) Check whether the mutable vector is empty.

Extracting subvectors

slice

Arguments

:: forall i n k s a p. (KnownNat i, KnownNat n, Unbox a)

=> p i

starting index

-> MVector ((i + n) + k) s a

-> MVector n s a

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

slice'

Arguments

:: forall i n k s a p. (KnownNat i, KnownNat n, Unbox a)

=> p i

starting index

-> p n

length

-> MVector ((i + n) + k) s a

-> MVector n s a

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

init :: forall n s a. Unbox a => MVector (n + 1) s a -> MVector n s a

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

tail :: forall n s a. Unbox a => MVector (1 + n) s a -> MVector n s a

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

take :: forall n k s a. (KnownNat n, Unbox a) => MVector (n + k) s a -> MVector n s a

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

take' :: forall n k s a p. (KnownNat n, Unbox a) => p n -> MVector (n + k) s a -> MVector n s a

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

drop :: forall n k s a. (KnownNat n, Unbox a) => MVector (n + k) s a -> MVector k s a

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

drop' :: forall n k s a p. (KnownNat n, Unbox a) => p n -> MVector (n + k) s a -> MVector k s a

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

splitAt :: forall n m s a. (KnownNat n, Unbox a) => MVector (n + m) s a -> (MVector n s a, MVector m s a)

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

splitAt' :: forall n m s a p. (KnownNat n, Unbox a) => p n -> MVector (n + m) s a -> (MVector n s a, MVector m s a)

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

Overlaps

overlaps :: forall n k s a. Unbox a => MVector n s a -> MVector k s a -> Bool

O(1) Check if two vectors overlap.

Construction

Initialisation

new :: forall n m a. (KnownNat n, PrimMonad m, Unbox a) => m (MVector n (PrimState m) a)

Create a mutable vector where the length is inferred from the type.

unsafeNew :: forall n m a. (KnownNat n, PrimMonad m, Unbox a) => m (MVector n (PrimState m) a)

Create a mutable vector where the length is inferred from the type. The memory is not initialized.

replicate :: forall n m a. (KnownNat n, PrimMonad m, Unbox a) => a -> m (MVector n (PrimState m) a)

Create a mutable vector where the length is inferred from the type and fill it with an initial value.

replicate' :: forall n m a p. (KnownNat n, PrimMonad m, Unbox a) => p n -> a -> m (MVector n (PrimState m) a)

Create a mutable vector where the length is given explicitly as a Proxy argument and fill it with an initial value.

replicateM :: forall n m a. (KnownNat n, PrimMonad m, Unbox a) => m a -> m (MVector n (PrimState m) a)

Create a mutable vector where the length is inferred from the type and fill it with values produced by repeatedly executing the monadic action.

replicateM' :: forall n m a p. (KnownNat n, PrimMonad m, Unbox a) => p n -> m a -> m (MVector n (PrimState m) a)

Create a mutable vector where the length is given explicitly as a Proxy argument and fill it with values produced by repeatedly executing the monadic action.

clone :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> m (MVector n (PrimState m) a)

Create a copy of a mutable vector.

Growing

grow :: forall n k m a p. (KnownNat k, PrimMonad m, Unbox a) => p k -> MVector n (PrimState m) a -> m (MVector (n + k) (PrimState m) a)

Grow a mutable vector by an amount given explicitly as a Proxy argument.

growFront :: forall n k m a p. (KnownNat k, PrimMonad m, Unbox a) => p k -> MVector n (PrimState m) a -> m (MVector (n + k) (PrimState m) a)

Grow a mutable vector (from the front) by an amount given explicitly as a Proxy argument.

Restricting memory usage

clear :: (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> m ()

Reset all elements of the vector to some undefined value, clearing all references to external objects.

Accessing individual elements

read :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> Finite n -> m a

O(1) Yield the element at a given type-safe position using Finite.

read' :: forall n k a m p. (KnownNat k, PrimMonad m, Unbox a) => MVector ((n + k) + 1) (PrimState m) a -> p k -> m a

O(1) Yield the element at a given type-safe position using Proxy.

write :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> Finite n -> a -> m ()

O(1) Replace the element at a given type-safe position using Finite.

write' :: forall n k a m p. (KnownNat k, PrimMonad m, Unbox a) => MVector ((n + k) + 1) (PrimState m) a -> p k -> a -> m ()

O(1) Replace the element at a given type-safe position using Proxy.

modify :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> (a -> a) -> Finite n -> m ()

O(1) Modify the element at a given type-safe position using Finite.

modify' :: forall n k a m p. (KnownNat k, PrimMonad m, Unbox a) => MVector ((n + k) + 1) (PrimState m) a -> (a -> a) -> p k -> m ()

O(1) Modify the element at a given type-safe position using Proxy.

swap :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> Finite n -> Finite n -> m ()

O(1) Swap the elements at the given type-safe positions using Finites.

exchange :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> Finite n -> a -> m a

O(1) Replace the element at a given type-safe position and return the old element, using Finite.

exchange' :: forall n k a m p. (KnownNat k, PrimMonad m, Unbox a) => MVector ((n + k) + 1) (PrimState m) a -> p k -> a -> m a

O(1) Replace the element at a given type-safe position and return the old element, using Finite.

unsafeRead :: forall n a m. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> Int -> m a

O(1) Yield the element at a given Int position without bounds checking.

unsafeWrite :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> Int -> a -> m ()

O(1) Replace the element at a given Int position without bounds checking.

unsafeModify :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> (a -> a) -> Int -> m ()

O(1) Modify the element at a given Int position without bounds checking.

unsafeSwap :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> Int -> Int -> m ()

O(1) Swap the elements at the given Int positions without bounds checking.

unsafeExchange :: forall n m a. (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> Int -> a -> m a

O(1) Replace the element at a given Int position and return the old element. No bounds checks are performed.

Modifying vectors

nextPermutation :: forall n e m. (Ord e, PrimMonad m, Unbox e) => MVector n (PrimState m) e -> m Bool

Compute the next permutation (lexicographically) of a given vector in-place. Returns False when the input is the last permutation.

Filling and copying

set :: (PrimMonad m, Unbox a) => MVector n (PrimState m) a -> a -> m ()

Set all elements of the vector to the given value.

copy

Arguments

:: (PrimMonad m, Unbox a)

=> MVector n (PrimState m) a

target

-> MVector n (PrimState m) a

source

-> m ()

Copy a vector. The two vectors may not overlap.

move

Arguments

:: (PrimMonad m, Unbox a)

=> MVector n (PrimState m) a

target

-> MVector n (PrimState m) a

source

-> m ()

Move the contents of a vector. If the two vectors do not overlap, this is equivalent to copy. Otherwise, the copying is performed as if the source vector were copied to a temporary vector and then the temporary vector was copied to the target vector.

unsafeCopy

Arguments

:: (PrimMonad m, Unbox a)

=> MVector n (PrimState m) a

target

-> MVector n (PrimState m) a

source

-> m ()

Copy a vector. The two vectors may not overlap. This is not checked.

Conversions

Unsized Mutable Vectors

toSized :: forall n a s. (KnownNat n, Unbox a) => MVector s a -> Maybe (MVector n s a)

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

Note that this does no copying; the returned MVector is a reference to the exact same vector in memory as the given one, and any modifications to it are also reflected in the given MVector.

withSized :: forall s a r. Unbox a => MVector s a -> (forall n. KnownNat n => MVector n s a -> r) -> r

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

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

Note that this does no copying; the returned MVector is a reference to the exact same vector in memory as the given one, and any modifications to it are also reflected in the given MVector.

fromSized :: MVector n s a -> MVector s a

Convert a MVector into a MVector.

Note that this does no copying; the returned MVector is a reference to the exact same vector in memory as the given one, and any modifications to it are also reflected in the given MVector.

Unbox

class (Vector Vector a, MVector MVector a) => Unbox a

Instances

Unbox Bool

Defined in Data.Vector.Unboxed.Base

Unbox Char

Defined in Data.Vector.Unboxed.Base

Unbox Double

Defined in Data.Vector.Unboxed.Base

Unbox Float

Defined in Data.Vector.Unboxed.Base

Unbox Int

Defined in Data.Vector.Unboxed.Base

Unbox Int8

Defined in Data.Vector.Unboxed.Base

Unbox Int16

Defined in Data.Vector.Unboxed.Base

Unbox Int32

Defined in Data.Vector.Unboxed.Base

Unbox Int64

Defined in Data.Vector.Unboxed.Base

Unbox Word

Defined in Data.Vector.Unboxed.Base

Unbox Word8

Defined in Data.Vector.Unboxed.Base

Unbox Word16

Defined in Data.Vector.Unboxed.Base

Unbox Word32

Defined in Data.Vector.Unboxed.Base

Unbox Word64

Defined in Data.Vector.Unboxed.Base

Unbox ()

Defined in Data.Vector.Unboxed.Base

Unbox All

Defined in Data.Vector.Unboxed.Base

Unbox Any

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Complex a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Min a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Max a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (First a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Last a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (WrappedMonoid a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Identity a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Dual a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Sum a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Product a)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Down a)

Defined in Data.Vector.Unboxed.Base

(Unbox a, Unbox b) => Unbox (a, b)

Defined in Data.Vector.Unboxed.Base

(Unbox a, Unbox b) => Unbox (Arg a b)

Defined in Data.Vector.Unboxed.Base

(Unbox a, Unbox b, Unbox c) => Unbox (a, b, c)

Defined in Data.Vector.Unboxed.Base

Unbox a => Unbox (Const a b)

Defined in Data.Vector.Unboxed.Base

Unbox (f a) => Unbox (Alt f a)

Defined in Data.Vector.Unboxed.Base

(Unbox a, KnownNat n) => Unbox (Vector Vector n a)

This instance allows to define sized matrices and tensors backed by continuous memory segments, which reduces memory allocations and relaxes pressure on garbage collector.

Defined in Data.Vector.Unboxed.Mutable.Sized

(Unbox a, Unbox b, Unbox c, Unbox d) => Unbox (a, b, c, d)

Defined in Data.Vector.Unboxed.Base

(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Unbox (a, b, c, d, e)

Defined in Data.Vector.Unboxed.Base

Unbox (f (g a)) => Unbox (Compose f g a)

Defined in Data.Vector.Unboxed.Base

(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Unbox (a, b, c, d, e, f)

Defined in Data.Vector.Unboxed.Base

Orphan instances

(Unbox a, KnownNat n) => Vector Vector (Vector Vector n a)

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector0 (PrimState m) (Vector Vector0 n a) -> m (Vector0 (Vector Vector0 n a))

basicUnsafeThaw :: PrimMonad m => Vector0 (Vector Vector0 n a) -> m (Mutable Vector0 (PrimState m) (Vector Vector0 n a))

basicLength :: Vector0 (Vector Vector0 n a) -> Int

basicUnsafeSlice :: Int -> Int -> Vector0 (Vector Vector0 n a) -> Vector0 (Vector Vector0 n a)

basicUnsafeIndexM :: Monad m => Vector0 (Vector Vector0 n a) -> Int -> m (Vector Vector0 n a)

basicUnsafeCopy :: PrimMonad m => Mutable Vector0 (PrimState m) (Vector Vector0 n a) -> Vector0 (Vector Vector0 n a) -> m ()

elemseq :: Vector0 (Vector Vector0 n a) -> Vector Vector0 n a -> b -> b

(Unbox a, KnownNat n) => MVector MVector (Vector Vector n a)

Methods

basicLength :: MVector s (Vector Vector0 n a) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s (Vector Vector0 n a) -> MVector s (Vector Vector0 n a)

basicOverlaps :: MVector s (Vector Vector0 n a) -> MVector s (Vector Vector0 n a) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Vector Vector0 n a))

basicInitialize :: PrimMonad m => MVector (PrimState m) (Vector Vector0 n a) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Vector Vector0 n a -> m (MVector (PrimState m) (Vector Vector0 n a))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Vector Vector0 n a) -> Int -> m (Vector Vector0 n a)

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Vector Vector0 n a) -> Int -> Vector Vector0 n a -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) (Vector Vector0 n a) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) (Vector Vector0 n a) -> Vector Vector0 n a -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Vector Vector0 n a) -> MVector (PrimState m) (Vector Vector0 n a) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Vector Vector0 n a) -> MVector (PrimState m) (Vector Vector0 n a) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Vector Vector0 n a) -> Int -> m (MVector (PrimState m) (Vector Vector0 n a))

(Unbox a, KnownNat n) => Unbox (Vector Vector n a)

This instance allows to define sized matrices and tensors backed by continuous memory segments, which reduces memory allocations and relaxes pressure on garbage collector.