The usual behavior of method
tlm_fifo<T>::nb_peek( T &t , int n ) const
is to return a reference to the item at location n, where 0 <= n < 
size()-1
However, the code includes a hack to accept n == -1, and have it 
equivalent to n == size()-1, i.e. peek the oldest item in the FIFO.
Strangely, nb_poke does not have the equivalent special case. 
Do we want to document this special case of nb_peek in the LRM, in which 
case, should we add the same special case n == -1 to nb_poke?
John A
-- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.Received on Mon Mar 29 09:30:29 2010
This archive was generated by hypermail 2.1.8 : Mon Mar 29 2010 - 09:30:32 PDT