Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- replicate :: (Prim a, PrimMonad m) => Int -> a -> m (MutableTypedByteArray a (PrimState m))
- data MutableTypedByteArray a s
- class Prim a
- data TypedByteArray a
- fromList :: Prim a => [a] -> TypedByteArray a
- generate :: Prim a => Int -> (Int -> a) -> TypedByteArray a
- newTypedByteArray :: forall a m. (Prim a, PrimMonad m) => Int -> m (MutableTypedByteArray a (PrimState m))
- unsafeFreezeTypedByteArray :: PrimMonad m => MutableTypedByteArray a (PrimState m) -> m (TypedByteArray a)
- unsafeIndex :: Prim a => TypedByteArray a -> Int -> a
- writeTypedByteArray :: (Prim a, PrimMonad m) => MutableTypedByteArray a (PrimState m) -> Int -> a -> m ()
Documentation
replicate :: (Prim a, PrimMonad m) => Int -> a -> m (MutableTypedByteArray a (PrimState m)) Source #
data MutableTypedByteArray a s Source #
Thin wrapper around 'MutableByteArray s' that makes signatures and indexing nicer to read.
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.
sizeOf#, alignment#, indexByteArray#, readByteArray#, writeByteArray#, setByteArray#, indexOffAddr#, readOffAddr#, writeOffAddr#, setOffAddr#
Instances
data TypedByteArray a Source #
Thin wrapper around ByteArray
that makes signatures and indexing nicer to read.
Instances
Show (TypedByteArray a) Source # | |
Defined in Data.TypedByteArray showsPrec :: Int -> TypedByteArray a -> ShowS # show :: TypedByteArray a -> String # showList :: [TypedByteArray a] -> ShowS # | |
NFData (TypedByteArray a) Source # | |
Defined in Data.TypedByteArray rnf :: TypedByteArray a -> () # |
fromList :: Prim a => [a] -> TypedByteArray a Source #
generate :: Prim a => Int -> (Int -> a) -> TypedByteArray a Source #
Construct a TypedByteArray
of the given length by applying the function to each index in [0..n-1]
.
newTypedByteArray :: forall a m. (Prim a, PrimMonad m) => Int -> m (MutableTypedByteArray a (PrimState m)) Source #
unsafeFreezeTypedByteArray :: PrimMonad m => MutableTypedByteArray a (PrimState m) -> m (TypedByteArray a) Source #
unsafeIndex :: Prim a => TypedByteArray a -> Int -> a Source #
Element index without bounds checking.
writeTypedByteArray :: (Prim a, PrimMonad m) => MutableTypedByteArray a (PrimState m) -> Int -> a -> m () Source #