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

Safe HaskellNone
LanguageHaskell98

Data.StorableVector.Pointer

Description

In principle you can traverse through a storable vector using repeated calls to viewL or using index. However this needs a bit of pointer arrangement and allocation. This data structure should make loops optimally fast.

Synopsis

Documentation

data Pointer a Source #

We might have name the data type iterator.

Constructors

Pointer 

Fields

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

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