23 May
2005
23 May
'05
10:26 a.m.
On Mon, May 23, 2005 at 12:13:48PM +0100, Ross Paterson wrote:
A general implementation of sequences (based on work with Ralf Hinze) can be found at
http://www.soi.city.ac.uk/~ross/software/html/Data.Sequence.html http://www.soi.city.ac.uk/~ross/software/Data/Sequence.hs
Our experiments indicate that its performance is comparable to (and sometimes better than) the best known persistent implementations(*). Non-persistent implementations are typically faster, but you need to be more careful when using them.
I'd like to propose this for base.
Comments welcome.
Another thing: O(1) reverse would be very nice if it could be implemented with no overhead for other operations ;-) Best regards Tomasz