Does newByteArray clear?

[David Feuer]

I'm looking to play around with an array-based structure with sub-linear
worst-case bounds. Array is pretty awkward in that context because creating
a new one takes O(n) time to initialize it. Is that all true of
newByteArray, or can I get one with arbitrary garbage in it for cheap?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/glasgow-haskell-users/attachments/20200826/df3f0abc/attachment.html>