| 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.
Documentation
We might have name the data type iterator.