Hello all,

In a nutshell, after some discussion and review, I concluded that there are
only two circular buffer implementations worth considering in Haskell (3 if
you only need access to the end of the buffer) - a mutable implementation
and a Data.Sequence-based one.

Somewhat to my surprise, my tests show that the Data.Sequence implementation
both performs better overall and scales better.

I'm not certain that I trust my methodology or implementation, and I would
greatly appreciate if anyone would be willing to review my work or provide
comments.

Details can be found at
http://johnlato.blogspot.com/2011/07/circular-buffers.html

Thanks very much in advance.

John L.
_______________________________________________
haskell-art mailing list
haskell-art@lurk.org
http://lists.lurk.org/mailman/listinfo/haskell-art

Reply via email to