| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
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.