dph-prim-seq- Data Parallel Haskell segmented arrays. (sequential implementation)

Safe HaskellNone



Irregular 2D unboxed arrays.

The difference between this type and something like Data.Vector (Data.Vector.Unboxed a) is that the inner arrays have kind # and cannot be bottom. This ensures that we can always lookup an element from an ArrayArray# without performing unboxings or checking for thunks.



newArrayArray :: Int -> ST s (MutableArrayArray s e)Source

Create an ArrayArray with the given number of elements.

copyArrayArray :: MutableArrayArray s ByteArray -> Int -> ArrayArray ByteArray -> Int -> Int -> ST s ()Source

Copy an ArrayArray