<div dir="ltr"><br><div class="gmail_quote"><div dir="ltr"><div><div class="Wj3C7c">On Fri, Sep 19, 2008 at 23:18, Don Stewart <span dir="ltr"><<a href="mailto:dons@galois.com" target="_blank">dons@galois.com</a>></span> wrote:<br>
<div class="gmail_quote"><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
RafaelGCPP.Linux:<br>
<div>> Hi all,<br>
><br>
> Is there any implementation of the rope data structure in Haskell?<br>
><br>
> I couldn't find any on Hackage, and I am intending to implement it.<br>
<br>
</div>There's no mature rope implementation. Can you write a bytestring-rope<br>
that outperforms lazy bytestrings please :)<br>
</blockquote></div><br></div></div>I'll give it a try, but cannot promise anything on the "outperform" part! :-)<br clear="all"><font color="#888888"><br>-- <br></font><div class="Ih2E3d">Rafael Gustavo da Cunha Pereira Pinto<br>
Electronic Engineer, MSc.<br>
</div></div>
</div><br><br clear="all"></div>