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.
-- ryan 2008/9/19 Rafael Gustavo da Cunha Pereira Pinto <[EMAIL PROTECTED]>: > 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. > > Regards, > > Rafael Gustavo da Cunha Pereira Pinto > Electronic Engineer, MSc. > > _______________________________________________ > Haskell-Cafe mailing list > [email protected] > http://www.haskell.org/mailman/listinfo/haskell-cafe > > _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
