Performance of functional queues

[Einar Karttunen]

Hello

I benchmarked the various functional queue implementations
including simple batched queues (data Q = Q [a] [a]),
Data.Queue and Data.Sequence.

The end result was that the simple batched queues are
fast and toList of Data.Sequence is very slow. For most
applications Data.Sequence is faster than Data.Queue, but
slower than the batched queues, but the differences are
not huge. Of course it offers other functionality which 
the other queues don't provide.

For pics of the results and the code look at
http://www.cs.helsinki.fi/u/ekarttun/haskell/sequence-performance/

- Einar Karttunen