ryani.spam at gmail.com
Fri Sep 19 22:15:13 EDT 2008
I think Data.Sequence uses fingertrees which are pretty fast.
I used a handgrown rope-like structure for ICFPC07 but I wish I had
known about Sequence; it would have likely just been better.
2008/9/19 Rafael Gustavo da Cunha Pereira Pinto <RafaelGCPP.Linux at gmail.com>:
> Hi all,
> Is there any implementation of the rope data structure in Haskell?
> I couldn't find any on Hackage, and I am intending to implement it.
> Rafael Gustavo da Cunha Pereira Pinto
> Electronic Engineer, MSc.
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
More information about the Haskell-Cafe