[R] queue implementation?

[Barry Rowlingson]

On Tue, Sep 7, 2010 at 3:26 PM, Spencer Graves
<spencer.graves at structuremonitoring.com> wrote:
>       I don't know what you mean by "a queue implementation", but consider
> the following:

 A queue is a FIFO data structure - the basic operations are to add an
item to the queue and to remove an item from the queue. The item
removed is always the item that has been in the queue the longest.

 Contrast with a LIFO data structure, or stack, where the item removed
is always the most recent.

 Both of which can be implemented in R very simply with lists.

Barry