Data.StorableVector.Lazy.Pointer

In principle you can traverse through a lazy storable vector using repeated calls to viewL. However this needs a bit of pointer arrangement and allocation. This data structure makes the inner loop faster, that consists of traversing through a chunk.

Documentation

data Pointer a

cons :: Storable a => Vector a -> Pointer a

viewL :: Storable a => Pointer a -> Maybe (a, Pointer a)

switchL :: Storable a => b -> (a -> Pointer a -> b) -> Pointer a -> b