Moduleunordered-containers-0.2.21Haskell2010

Data.HashMap.Internal.Array

WARNING

This module is considered internal.

The Package Versioning Policy does not apply.

The contents of this module may change in any way whatsoever and without any warning between minor versions of this package.

Authors importing this module are expected to track development closely.

Description

Zero based arrays.

Note that no bounds checking are performed.

2 types
43 values

Packageunordered-containers-0.2.21
Exports45
LanguageHaskell2010
LicenceBSD-3-Clause
SourceArray.hs

datadata Array a

Constructors

Array
- unArray :: !SmallArray# a

Instances4NFData1, Lift, Show, NFData

NFData1 ArrayDefined in unordered-containers-0.2.21 · Data.HashMap.Internal.Array
Lift a => Lift (Array a)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal.Array
Show a => Show (Array a)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal.Array
NFData a => NFData (Array a)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal.Array

datadata MArray s a

Constructors

MArray
- unMArray :: !SmallMutableArray# s a

Creation

6 declarations

valuenew :: Int -> a -> ST s (MArray s a)

Create a new mutable array of specified size, in the specified state thread, with each element containing the specified initial value.

valuenew_ :: Int -> ST s (MArray s a)

valuesingleton :: a -> Array a

valuesingletonM :: a -> ST s (Array a)

valuesnoc :: Array a -> a -> Array a

valuepair :: a -> a -> Array a

Basic interface

20 declarations

valuelength :: Array a -> Int

valuelengthM :: MArray s a -> ST s Int

valueread :: MArray s a -> Int -> ST s a

valuewrite :: MArray s a -> Int -> a -> ST s ()

valueindexM :: Array a -> Int -> ST s a

valueindex# :: Array a -> Int -> (# a #)

Note that we don't have an index function with type

Array a -> Int -> a

We used to have it, but it was prone to creating thunks. See #538.

valueupdate :: Array e -> Int -> e -> Array e

O(n) Update the element at the given position in this array.

valueupdateWith' :: Array e -> Int -> (e -> e) -> Array e

O(n) Update the element at the given position in this array, by applying a function to it. Evaluates the element to WHNF before inserting it into the array.

valueunsafeUpdateM :: Array e -> Int -> e -> ST s ()

O(1) Update the element at the given position in this array, without copying.

valueinsert :: Array e -> Int -> e -> Array e

O(n) Insert an element at the given position in this array, increasing its size by one.

valueinsertM :: Array e -> Int -> e -> ST s (Array e)

O(n) Insert an element at the given position in this array, increasing its size by one.

valuedelete :: Array e -> Int -> Array e

O(n) Delete an element at the given position in this array, decreasing its size by one.

valuesameArray1 :: (a -> b -> Bool) -> Array a -> Array b -> Bool

valueunsafeFreeze :: MArray s a -> ST s (Array a)

valueunsafeThaw :: Array a -> ST s (MArray s a)

valueunsafeSameArray :: Array a -> Array b -> Bool

valuerun :: (forall s. ST s (MArray s e)) -> Array e

valuecopy :: Array e -> Int -> MArray s e -> Int -> Int -> ST s ()

Unsafely copy the elements of an array. Array bounds are not checked.

valuecopyM :: MArray s e -> Int -> MArray s e -> Int -> Int -> ST s ()

Unsafely copy the elements of an array. Array bounds are not checked.

valuecloneM :: MArray s a -> Int -> Int -> ST s (MArray s a)

Folds

17 declarations

valuefoldl :: (b -> a -> b) -> b -> Array a -> b

valuefoldl' :: (b -> a -> b) -> b -> Array a -> b

valuefoldr :: (a -> b -> b) -> b -> Array a -> b

valuefoldr' :: (a -> b -> b) -> b -> Array a -> b

valuefoldMap :: Monoid m => (a -> m) -> Array a -> m

valueall :: (a -> Bool) -> Array a -> Bool

Verifies that a predicate holds for all elements of an array.

valuethaw :: Array e -> Int -> Int -> ST s (MArray s e)

valuemap :: (a -> b) -> Array a -> Array b

valuemap' :: (a -> b) -> Array a -> Array b

Strict version of map.

valuefilter :: (a -> Bool) -> Array a -> Array a

valuemapMaybe :: (a -> Maybe b) -> Array a -> Array b

valuetraverse :: Applicative f => (a -> f b) -> Array a -> f (Array b)

valuetraverse' :: Applicative f => (a -> f b) -> Array a -> f (Array b)

valuetoList :: Array a -> [a]

valuefromList :: Int -> [a] -> Array a

valuefromList' :: Int -> [a] -> Array a

valueshrink :: MArray s a -> Int -> ST s (MArray s a)

The returned array is the same as the array given, as it is shrunk in place.