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

Safe HaskellNone



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.


switchL :: Storable a => b -> (a -> Pointer a -> b) -> Pointer a -> bSource