From: James M. Curran (jamescurran_at_[hidden])
Date: 2000-11-11 16:55:10
This could be accomplished with a standard vector, and a "circular
iterator" which loops back to the beginning when it reachs the end.
I wrote an article about it some time ago
--- In boost_at_[hidden], "AlisdairM - BTInternet" <AlisdairM_at_b...>
> The proposed class is for a fixed-length queue, such that pushing
> new values when the queue is 'full' automatically pops the oldest
> value. A typical use would be in some data-monitoring application
> that wants to keep a 10-minute buffer of data. New data is always
> added without the need to 'house-clean' the old. Another use might
> be scrolling around a zoomed range in a scrollable window, where
> the queue 'length' corresponds the size of the scrolling region.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk