Fast Sequences

Jim Apple jbapple+haskell-lib at
Sun Mar 26 16:11:13 EST 2006

The proposed Data.Sequence ( ) has
O(n) reverse. Section 6 of
claims that it can be faster.

Also, according to ,
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


More information about the Libraries mailing list