On Thu, May 27, 2010 at 2:44 PM, Pierre-Etienne Meunier <pierreetienne.meun...@gmail.com> wrote: > ** Advertisement ** > Have you tried the library I have written, Data.Rope ? > ** End of advertisement ** > The algorithmic complexity of most operations on ropes is way better than on > bytestrings : log n for all operations, except traversals, of course. > Cheers, > PE
How is a Data.Rope.Rope different from a Data.Sequence.Seq Char? --Max _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
