[Haskell-cafe] Re: Data.Ring -- Pre-announce

Tillmann Rendel rendel at cs.au.dk
Fri Jan 1 07:36:41 EST 2010


Iavor Diatchki schrieb:
> I usually refer to this structure as a RingBuffer.


According to my understanding, and to wikipedia [1], a ring buffer is a 
data structure used to implement O(1) bounded FIFO queues with mutable 

So in a ring buffer, you have distinct reading and writing foci, while 
in John's circular list, you have only one focus for reading and writing.


[1] http://en.wikipedia.org/wiki/Circular_buffer

More information about the Haskell-Cafe mailing list