Data.Primitive.SmallArray

primitive-0.7.4.0: Primitive memory-related operations

Copyright | (c) 2015 Dan Doel
License | BSD3
Maintainer | libraries@haskell.org
Portability | non-portable
Safe Haskell | Safe-Inferred
Language | Haskell2010

Data.Primitive.SmallArray

Description

Small arrays are boxed (im)mutable arrays.

The underlying structure of the `Array` type contains a card table, allowing segments of the array to be marked as having been mutated. This allows the garbage collector to only re-traverse segments of the array that have been marked during certain phases, rather than having to traverse the entire array.

`SmallArray` lacks this table. This means that it takes up less memory and has slightly faster writes. It is also more efficient during garbage collection so long as the card table would have a single entry covering the entire array. These advantages make them suitable for use as arrays that are known to be small.

The card size is 128, so for uses much larger than that, `Array` would likely be superior.

Synopsis

- data SmallArray a = SmallArray (SmallArray# a)
- data SmallMutableArray s a = SmallMutableArray (SmallMutableArray# s a)
- newSmallArray :: PrimMonad m => Int -> a -> m (SmallMutableArray (PrimState m) a)
- readSmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> m a
- writeSmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> a -> m ()
- copySmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> SmallArray a -> Int -> Int -> m ()
- copySmallMutableArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> SmallMutableArray (PrimState m) a -> Int -> Int -> m ()
- indexSmallArray :: SmallArray a -> Int -> a
- indexSmallArrayM :: Monad m => SmallArray a -> Int -> m a
- indexSmallArray## :: SmallArray a -> Int -> (# a #)
- cloneSmallArray :: SmallArray a -> Int -> Int -> SmallArray a
- cloneSmallMutableArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> Int -> m (SmallMutableArray (PrimState m) a)
- freezeSmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> Int -> m (SmallArray a)
- unsafeFreezeSmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> m (SmallArray a)
- thawSmallArray :: PrimMonad m => SmallArray a -> Int -> Int -> m (SmallMutableArray (PrimState m) a)
- unsafeThawSmallArray :: PrimMonad m => SmallArray a -> m (SmallMutableArray (PrimState m) a)
- runSmallArray :: (forall s. ST s (SmallMutableArray s a)) -> SmallArray a
- createSmallArray :: Int -> a -> (forall s. SmallMutableArray s a -> ST s ()) -> SmallArray a
- sizeofSmallArray :: SmallArray a -> Int
- sizeofSmallMutableArray :: SmallMutableArray s a -> Int
- shrinkSmallMutableArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> m ()
- emptySmallArray :: SmallArray a
- smallArrayFromList :: [a] -> SmallArray a
- smallArrayFromListN :: Int -> [a] -> SmallArray a
- mapSmallArray' :: (a -> b) -> SmallArray a -> SmallArray b
- traverseSmallArrayP :: PrimMonad m => (a -> m b) -> SmallArray a -> m (SmallArray b)

# Documentation

data SmallArray a #

Constructors

SmallArray (SmallArray# a) |

#### Instances

Instances details

MonadFail SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods fail :: String -> SmallArray a
MonadFix SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods mfix :: (a -> SmallArray a) -> SmallArray a
MonadZip SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods mzip :: SmallArray a -> SmallArray b -> SmallArray (a, b) mzipWith :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c munzip :: SmallArray (a, b) -> (SmallArray a, SmallArray b)
Foldable SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods fold :: Monoid m => SmallArray m -> m foldMap :: Monoid m => (a -> m) -> SmallArray a -> m foldMap' :: Monoid m => (a -> m) -> SmallArray a -> m foldr :: (a -> b -> b) -> b -> SmallArray a -> b foldr' :: (a -> b -> b) -> b -> SmallArray a -> b foldl :: (b -> a -> b) -> b -> SmallArray a -> b foldl' :: (b -> a -> b) -> b -> SmallArray a -> b foldr1 :: (a -> a -> a) -> SmallArray a -> a foldl1 :: (a -> a -> a) -> SmallArray a -> a toList :: SmallArray a -> [a] null :: SmallArray a -> Bool length :: SmallArray a -> Int elem :: Eq a => a -> SmallArray a -> Bool maximum :: Ord a => SmallArray a -> a minimum :: Ord a => SmallArray a -> a sum :: Num a => SmallArray a -> a product :: Num a => SmallArray a -> a
Eq1 SmallArray # | Since: 0.6.4.0
Instance details Defined in Data.Primitive.SmallArray Methods liftEq :: (a -> b -> Bool) -> SmallArray a -> SmallArray b -> Bool
Ord1 SmallArray # | Since: 0.6.4.0
Instance details Defined in Data.Primitive.SmallArray Methods liftCompare :: (a -> b -> Ordering) -> SmallArray a -> SmallArray b -> Ordering
Read1 SmallArray # | Since: 0.6.4.0
Instance details Defined in Data.Primitive.SmallArray Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (SmallArray a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [SmallArray a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (SmallArray a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [SmallArray a]
Show1 SmallArray # | Since: 0.6.4.0
Instance details Defined in Data.Primitive.SmallArray Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> SmallArray a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [SmallArray a] -> ShowS
Traversable SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods traverse :: Applicative f => (a -> f b) -> SmallArray a -> f (SmallArray b) sequenceA :: Applicative f => SmallArray (f a) -> f (SmallArray a) mapM :: Monad m => (a -> m b) -> SmallArray a -> m (SmallArray b) sequence :: Monad m => SmallArray (m a) -> m (SmallArray a)
Alternative SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods empty :: SmallArray a (<|>) :: SmallArray a -> SmallArray a -> SmallArray a some :: SmallArray a -> SmallArray [a] many :: SmallArray a -> SmallArray [a]
Applicative SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods pure :: a -> SmallArray a (<*>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c (*>) :: SmallArray a -> SmallArray b -> SmallArray b (<*) :: SmallArray a -> SmallArray b -> SmallArray a
Functor SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods fmap :: (a -> b) -> SmallArray a -> SmallArray b (<$) :: a -> SmallArray b -> SmallArray a
Monad SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods (>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b (>>) :: SmallArray a -> SmallArray b -> SmallArray b return :: a -> SmallArray a
MonadPlus SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods mzero :: SmallArray a mplus :: SmallArray a -> SmallArray a -> SmallArray a
NFData1 SmallArray # |
Instance details Defined in Data.Primitive.SmallArray Methods liftRnf :: (a -> ()) -> SmallArray a -> ()
Lift a => Lift (SmallArray a :: Type) # |
Instance details Defined in Data.Primitive.SmallArray Methods lift :: Quote m => SmallArray a -> m Exp liftTyped :: forall (m :: Type -> Type). Quote m => SmallArray a -> Code m (SmallArray a)
Data a => Data (SmallArray a) # |
Instance details Defined in Data.Primitive.SmallArray Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SmallArray a -> c (SmallArray a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SmallArray a) toConstr :: SmallArray a -> Constr dataTypeOf :: SmallArray a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SmallArray a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SmallArray a)) gmapT :: (forall b. Data b => b -> b) -> SmallArray a -> SmallArray a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SmallArray a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SmallArray a -> r gmapQ :: (forall d. Data d => d -> u) -> SmallArray a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> SmallArray a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> SmallArray a -> m (SmallArray a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SmallArray a -> m (SmallArray a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SmallArray a -> m (SmallArray a)
Monoid (SmallArray a) # |
Instance details Defined in Data.Primitive.SmallArray Methods mempty :: SmallArray a mappend :: SmallArray a -> SmallArray a -> SmallArray a mconcat :: [SmallArray a] -> SmallArray a
Semigroup (SmallArray a) # | Since: 0.6.3.0
Instance details Defined in Data.Primitive.SmallArray Methods (<>) :: SmallArray a -> SmallArray a -> SmallArray a sconcat :: NonEmpty (SmallArray a) -> SmallArray a stimes :: Integral b => b -> SmallArray a -> SmallArray a
IsList (SmallArray a) # |
Instance details Defined in Data.Primitive.SmallArray Associated Types type Item (SmallArray a) Methods fromList :: [Item (SmallArray a)] -> SmallArray a # fromListN :: Int -> [Item (SmallArray a)] -> SmallArray a # toList :: SmallArray a -> [Item (SmallArray a)]
Read a => Read (SmallArray a) # |
Instance details Defined in Data.Primitive.SmallArray Methods readsPrec :: Int -> ReadS (SmallArray a) readList :: ReadS [SmallArray a] readPrec :: ReadPrec (SmallArray a) readListPrec :: ReadPrec [SmallArray a]
Show a => Show (SmallArray a) # |
Instance details Defined in Data.Primitive.SmallArray Methods showsPrec :: Int -> SmallArray a -> ShowS show :: SmallArray a -> String showList :: [SmallArray a] -> ShowS
NFData a => NFData (SmallArray a) # |
Instance details Defined in Data.Primitive.SmallArray Methods rnf :: SmallArray a -> ()
Eq a => Eq (SmallArray a) # |
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallArray a -> SmallArray a -> Bool (/=) :: SmallArray a -> SmallArray a -> Bool
Ord a => Ord (SmallArray a) # | Lexicographic ordering. Subject to change between major versions.
Instance details Defined in Data.Primitive.SmallArray Methods compare :: SmallArray a -> SmallArray a -> Ordering (<) :: SmallArray a -> SmallArray a -> Bool (<=) :: SmallArray a -> SmallArray a -> Bool (>) :: SmallArray a -> SmallArray a -> Bool (>=) :: SmallArray a -> SmallArray a -> Bool max :: SmallArray a -> SmallArray a -> SmallArray a min :: SmallArray a -> SmallArray a -> SmallArray a
type Item (SmallArray a) # |
Instance details Defined in Data.Primitive.SmallArray type Item (SmallArray a) = a

data SmallMutableArray s a #

Constructors

SmallMutableArray (SmallMutableArray# s a) |

#### Instances

Instances details

(Typeable s, Typeable a) => Data (SmallMutableArray s a) # |
Instance details Defined in Data.Primitive.SmallArray Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SmallMutableArray s a -> c (SmallMutableArray s a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SmallMutableArray s a) toConstr :: SmallMutableArray s a -> Constr dataTypeOf :: SmallMutableArray s a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SmallMutableArray s a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SmallMutableArray s a)) gmapT :: (forall b. Data b => b -> b) -> SmallMutableArray s a -> SmallMutableArray s a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SmallMutableArray s a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SmallMutableArray s a -> r gmapQ :: (forall d. Data d => d -> u) -> SmallMutableArray s a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> SmallMutableArray s a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> SmallMutableArray s a -> m (SmallMutableArray s a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SmallMutableArray s a -> m (SmallMutableArray s a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SmallMutableArray s a -> m (SmallMutableArray s a)
Eq (SmallMutableArray s a) # |
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool (/=) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool

newSmallArray #

Arguments

:: PrimMonad m |
=> Int | size
-> a | initial contents
-> m (SmallMutableArray (PrimState m) a) |

Create a new small mutable array.

Note: this function does not check if the input is non-negative.

readSmallArray #

Arguments

:: PrimMonad m |
=> SmallMutableArray (PrimState m) a | array
-> Int | index
-> m a |

Read the element at a given index in a mutable array.

Note: this function does not do bounds checking.

writeSmallArray #

Arguments

:: PrimMonad m |
=> SmallMutableArray (PrimState m) a | array
-> Int | index
-> a | new element
-> m () |

Write an element at the given idex in a mutable array.

Note: this function does not do bounds checking.

copySmallArray #

Arguments

:: PrimMonad m |
=> SmallMutableArray (PrimState m) a | destination
-> Int | destination offset
-> SmallArray a | source
-> Int | source offset
-> Int | length
-> m () |

Copy a slice of an immutable array into a mutable array.

Note: this function does not do bounds or overlap checking.

copySmallMutableArray #

Arguments

:: PrimMonad m |
=> SmallMutableArray (PrimState m) a | destination
-> Int | destination offset
-> SmallMutableArray (PrimState m) a | source
-> Int | source offset
-> Int | length
-> m () |

Copy a slice of one mutable array into another.

Note: this function does not do bounds or overlap checking.

indexSmallArray #

Arguments

:: SmallArray a | array
-> Int | index
-> a |

Look up an element in an immutable array.

Note: this function does not do bounds checking.

indexSmallArrayM #

Arguments

:: Monad m |
=> SmallArray a | array
-> Int | index
-> m a |

Look up an element in an immutable array.

The purpose of returning a result using a monad is to allow the caller to avoid retaining references to the array. Evaluating the return value will cause the array lookup to be performed, even though it may not require the element of the array to be evaluated (which could throw an exception). For instance:

    data Box a = Box a
    ...

    f sa = case indexSmallArrayM sa 0 of
      Box x -> ...

`x` is not a closure that references `sa` as it would be if we instead wrote:

    let x = indexSmallArray sa 0

It also does not prevent `sa` from being garbage collected.

Note that `Identity` is not adequate for this use, as it is a newtype, and cannot be evaluated without evaluating the element.

Note: this function does not do bounds checking.

indexSmallArray## :: SmallArray a -> Int -> (# a #) #

Read a value from the immutable array at the given index, returning the result in an unboxed unary tuple. This is currently used to implement folds.

Note: this function does not do bounds checking.

cloneSmallArray #

Arguments

:: SmallArray a | source
-> Int | offset
-> Int | length
-> SmallArray a |

Create a copy of a slice of an immutable array.

Note: The provided array should contain the full subrange specified by the two Ints, but this is not checked.

cloneSmallMutableArray #

Arguments

:: PrimMonad m |
=> SmallMutableArray (PrimState m) a | source
-> Int | offset
-> Int | length
-> m (SmallMutableArray (PrimState m) a) |

Create a copy of a slice of a mutable array.

Note: The provided array should contain the full subrange specified by the two Ints, but this is not checked.

freezeSmallArray #

Arguments

:: PrimMonad m |
=> SmallMutableArray (PrimState m) a | source
-> Int | offset
-> Int | length
-> m (SmallArray a) |

Create an immutable array corresponding to a slice of a mutable array.

This operation copies the portion of the array to be frozen.

Note: The provided array should contain the full subrange specified by the two Ints, but this is not checked.

unsafeFreezeSmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> m (SmallArray a) #

Render a mutable array immutable.

This operation performs no copying, so care must be taken not to modify the input array after freezing.

thawSmallArray #

Arguments

:: PrimMonad m |
=> SmallArray a | source
-> Int | offset
-> Int | length
-> m (SmallMutableArray (PrimState m) a) |

Create a mutable array corresponding to a slice of an immutable array.

This operation copies the portion of the array to be thawed.

Note: The provided array should contain the full subrange specified by the two Ints, but this is not checked.

unsafeThawSmallArray :: PrimMonad m => SmallArray a -> m (SmallMutableArray (PrimState m) a) #

Render an immutable array mutable.

This operation performs no copying, so care must be taken with its use.

runSmallArray :: (forall s. ST s (SmallMutableArray s a)) -> SmallArray a #

Execute the monadic action and freeze the resulting array.

    runSmallArray m = runST $ m >>= unsafeFreezeSmallArray

createSmallArray :: Int -> a -> (forall s. SmallMutableArray s a -> ST s ()) -> SmallArray a #

Create an array of the given size with a default value, apply the monadic function and freeze the result. If the size is 0, return `emptySmallArray` (rather than a new copy thereof).

    createSmallArray 0 _ _ = emptySmallArray
    createSmallArray n x f = runSmallArray $ do
      mary <- newSmallArray n x
      f mary
      pure mary

sizeofSmallArray :: SmallArray a -> Int #

The number of elements in an immutable array.

sizeofSmallMutableArray :: SmallMutableArray s a -> Int #

The number of elements in a mutable array.

shrinkSmallMutableArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> m () #

Shrink the mutable array in place. The size given must be equal to or less than the current size of the array. This is not checked.

emptySmallArray :: SmallArray a #

The empty `SmallArray`.

smallArrayFromList :: [a] -> SmallArray a #

Create a `SmallArray` from a list.

smallArrayFromListN :: Int -> [a] -> SmallArray a #

Create a `SmallArray` from a list of a known length. If the length of the list does not match the given length, this throws an exception.

mapSmallArray' :: (a -> b) -> SmallArray a -> SmallArray b #

Strict map over the elements of the array.

traverseSmallArrayP :: PrimMonad m => (a -> m b) -> SmallArray a -> m (SmallArray b) #

This is the fastest, most straightforward way to traverse an array, but it only works correctly with a sufficiently "affine" `PrimMonad` instance. In particular, it must only produce one result array. `ListT`-transformed monads, for example, will not work right at all.