Safe Haskell	None
Language	Haskell98

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

data Pointer a = Pointer {
- fptr :: !(ForeignPtr a)
- ptr :: !(Ptr a)
- left :: !Int
}
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

Documentation

data Pointer a Source #

We might have name the data type iterator.

Constructors

Pointer
Fields fptr :: !(ForeignPtr a) ptr :: !(Ptr a) left :: !Int

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

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

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