storablevector-0.2.13.1: Fast, packed, strict storable arrays with a list interface like ByteString

Safe HaskellNone
LanguageHaskell98

Data.StorableVector.Lazy.Pointer

Description

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

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

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