26 Mar
2006
26 Mar
'06
4:11 p.m.
The proposed Data.Sequence ( http://www.soi.city.ac.uk/~ross/software/html/Data.Sequence.html ) has O(n) reverse. Section 6 of http://citeseer.ist.psu.edu/560336.html claims that it can be faster. Also, according to http://citeseer.ist.psu.edu/kaplan96purely.html , there is a sequence type with (><) of O(log log n). The latter one of these doesn't support the stated time bounds for different versions of the same structure. Do 2-3 finger trees support that? Jim