fast implementation for circular buffer or stack

[Leslie Walko <l.walko@xxxxxxxxxxx>]

Hello:

To the best of my knowledge, EL implements arrays at
circular buffers, also known as FIFO (First In First Out)
queues.

Anyone know how to access these data structures NATIVELY ?

If FIFO is NOT an accessible data structure from EL, does
anyone have a fast implementation FIFO implementation coded
in EL?  
(For example, a ping-pong buffer is a fast way to simulate a
FIFO queue -- and I do not mind wasting memory for speed.)

With thanks,
Leslie

-- 
Regards,
Leslie Walko
610-688-2442
--
 "Life is a tragedy for those who feel, a comedy for those
who think"
	Horace Walpole, 4th earl of Orford, in a letter dated about
1770