It's a good question, I don't think there is something in the vector library that can handle chunks of vectors...<br>If both lazy and strict bytestrings are to be generalized, it would <i>at last</i> permit to have a single interface to them, thanks to Data.Vector.Generic,<br>
and no longer two identical interfaces in separate modules, which forces
to duplicate each code which handles bytestrings so that it can deal
with the two flavours.<br><br><div class="gmail_quote">2011/10/17 Jean-Marie Gaillourdet <span dir="ltr"><<a href="mailto:jmg@gaillourdet.net">jmg@gaillourdet.net</a>></span><br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
Hi,<br>
<div class="im"><br>
On 17.10.2011, at 12:14, Bas van Dijk wrote:<br>
<br>
> On 17 October 2011 10:18, Christian Maeder <<a href="mailto:Christian.Maeder@dfki.de">Christian.Maeder@dfki.de</a>> wrote:<br>
><br>
</div><div class="im">> My idea is that when vector-bytestring is as fast as bytestring, it<br>
> can replace it. When that happens it doesn't matter if users use the<br>
> vector interface. I would even recommend it over using the bytestring<br>
> interface so that bytestring can eventually be deprecated in favor of<br>
> vector.<br>
<br>
</div>What about lazy bytestrings? I wasn't aware that vector also supports huge logical array which are suitable for very large io streams. I'd be glad if vector is also suitable for such applications. But if not, then there is still a need for the bytestring package in order to support streaming gigabytes of data in a small constant sized heap.<br>
<br>
Cheers,<br>
<font color="#888888"> Jean<br>
</font><div><div></div><div class="h5">_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</div></div></blockquote></div><br>