Documentation

Create a new small mutable array.

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

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

Note: this function does not do bounds checking.

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

Note: this function does not do bounds checking.

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

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

Copy a slice of one mutable array into another.

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

Look up an element in an immutable array.

Note: this function does not do bounds checking.

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.

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.

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.

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.

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.

Render a mutable array immutable.

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

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.

Render an immutable array mutable.

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

Execute the monadic action and freeze the resulting array.

runSmallArray m = runST $ m >>= unsafeFreezeSmallArray

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

The number of elements in an immutable array.

The number of elements in a mutable array.

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.

The empty SmallArray.

Create a SmallArray from a list.

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.

Strict map over the elements of the array.

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.