Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data Array a :: * -> * = Array {}
- data MutableArray s a :: * -> * -> * = MutableArray {
- marray# :: MutableArray# s a
- newArray :: (HasCallStack, PrimMonad m) => Int -> a -> m (MutableArray (PrimState m) a)
- readArray :: (HasCallStack, PrimMonad m) => MutableArray (PrimState m) a -> Int -> m a
- writeArray :: (HasCallStack, PrimMonad m) => MutableArray (PrimState m) a -> Int -> a -> m ()
- indexArray :: HasCallStack => Array a -> Int -> a
- indexArrayM :: HasCallStack => Monad m => Array a -> Int -> m a
- freezeArray :: (HasCallStack, PrimMonad m) => MutableArray (PrimState m) a -> Int -> Int -> m (Array a)
- thawArray :: (HasCallStack, PrimMonad m) => Array a -> Int -> Int -> m (MutableArray (PrimState m) a)
- unsafeFreezeArray :: PrimMonad m => MutableArray (PrimState m) a -> m (Array a)
- unsafeThawArray :: PrimMonad m => Array a -> m (MutableArray (PrimState m) a)
- sameMutableArray :: MutableArray s a -> MutableArray s a -> Bool
- copyArray :: (HasCallStack, PrimMonad m) => MutableArray (PrimState m) a -> Int -> Array a -> Int -> Int -> m ()
- copyMutableArray :: (HasCallStack, PrimMonad m) => MutableArray (PrimState m) a -> Int -> MutableArray (PrimState m) a -> Int -> Int -> m ()
- cloneArray :: HasCallStack => Array a -> Int -> Int -> Array a
- cloneMutableArray :: (HasCallStack, PrimMonad m) => MutableArray (PrimState m) a -> Int -> Int -> m (MutableArray (PrimState m) a)
- sizeofArray :: Array a -> Int
- sizeofMutableArray :: MutableArray s a -> Int
Documentation
Boxed arrays
Monad Array | |
Functor Array | |
MonadFix Array | |
Applicative Array | |
Foldable Array | |
Traversable Array | |
Eq1 Array | Since: 0.6.4.0 |
Ord1 Array | Since: 0.6.4.0 |
Read1 Array | Since: 0.6.4.0 |
Show1 Array | Since: 0.6.4.0 |
MonadZip Array | |
Alternative Array | |
MonadPlus Array | |
IsList (Array a) | |
Eq a => Eq (Array a) | |
Data a => Data (Array a) | |
Ord a => Ord (Array a) | Lexicographic ordering. Subject to change between major versions. |
Read a => Read (Array a) | |
Show a => Show (Array a) | |
Semigroup (Array a) | Since: 0.6.3.0 |
Monoid (Array a) | |
PrimUnlifted (Array a) | |
type Item (Array a) | |
data MutableArray s a :: * -> * -> * #
Mutable boxed arrays associated with a primitive state token.
MutableArray | |
|
Eq (MutableArray s a) | |
(Typeable * s, Typeable * a) => Data (MutableArray s a) | |
PrimUnlifted (MutableArray s a) | |
newArray :: (HasCallStack, PrimMonad m) => Int -> a -> m (MutableArray (PrimState m) a) Source #
readArray :: (HasCallStack, PrimMonad m) => MutableArray (PrimState m) a -> Int -> m a Source #
writeArray :: (HasCallStack, PrimMonad m) => MutableArray (PrimState m) a -> Int -> a -> m () Source #
indexArray :: HasCallStack => Array a -> Int -> a Source #
indexArrayM :: HasCallStack => Monad m => Array a -> Int -> m a Source #
:: (HasCallStack, PrimMonad m) | |
=> MutableArray (PrimState m) a | source |
-> Int | offset |
-> Int | length |
-> m (Array a) |
:: (HasCallStack, PrimMonad m) | |
=> Array a | source |
-> Int | offset |
-> Int | length |
-> m (MutableArray (PrimState m) a) |
unsafeFreezeArray :: PrimMonad m => MutableArray (PrimState m) a -> m (Array a) #
Convert a mutable array to an immutable one without copying. The array should not be modified after the conversion.
unsafeThawArray :: PrimMonad m => Array a -> m (MutableArray (PrimState m) a) #
Convert an immutable array to an mutable one without copying. The immutable array should not be used after the conversion.
sameMutableArray :: MutableArray s a -> MutableArray s a -> Bool #
Check whether the two arrays refer to the same memory block.
:: (HasCallStack, PrimMonad m) | |
=> MutableArray (PrimState m) a | destination array |
-> Int | offset into destination array |
-> Array a | source array |
-> Int | offset into source array |
-> Int | number of elements to copy |
-> m () |
:: (HasCallStack, PrimMonad m) | |
=> MutableArray (PrimState m) a | destination array |
-> Int | offset into destination array |
-> MutableArray (PrimState m) a | source array |
-> Int | offset into source array |
-> Int | number of elements to copy |
-> m () |
:: HasCallStack | |
=> Array a | source array |
-> Int | offset into destination array |
-> Int | number of elements to copy |
-> Array a |
:: (HasCallStack, PrimMonad m) | |
=> MutableArray (PrimState m) a | source array |
-> Int | offset into destination array |
-> Int | number of elements to copy |
-> m (MutableArray (PrimState m) a) |
sizeofArray :: Array a -> Int #
sizeofMutableArray :: MutableArray s a -> Int #