Data.StorableVector.Lazy.Builder

Build a lazy storable vector by incrementally adding an element. This is analogous to Data.Binary.Builder for Data.ByteString.Lazy.

Attention: This implementation is still almost 3 times slower than constructing a lazy storable vector using unfoldr in our Chorus speed test.

Documentation

data Builder a

Instances

Storable a => Monoid (Builder a)

Methods

mempty :: Builder a

mappend :: Builder a -> Builder a -> Builder a

mconcat :: [Builder a] -> Builder a

toLazyStorableVector :: Storable a => ChunkSize -> Builder a -> Vector a

toLazyStorableVector (ChunkSize 7) $ foldMap put ['a'..'z']

put :: Storable a => a -> Builder a

flush :: Storable a => Builder a

Set a laziness break.