On Wed, Apr 19, 2006 at 09:32:19PM +0200, Udo Stenzel wrote:
> We don't have an implementation of Ropes (yet?). I think, a Finger Tree
> of Fast Packed Strings might be the closest thing. I'd even implement
> it this way, if the low performance of raw Strings finally overcame my
> inertia...
Sounds like a good idea. I've placed the general annotated finger tree
structure from our paper on the webpage
http://www.soi.city.ac.uk/~ross/papers/FingerTree.html
It might be useful if anyone would like to attempt this.
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
