UnboundedFifoBuffer is a very efficient buffer implementation. According to performance testing, it exhibits a constant access time, but it also outperforms ArrayList when used for the same purpose.
The removal order of an
UnboundedFifoBuffer
is based on the insertion order; elements are removed in the same order in which they were added. The iteration order is the same as the removal order.
The {@link #remove()} and {@link #get()} operations perform in constant time.The {@link #add(Object)} operation performs in amortized constant time. Allother operations perform in linear time or worse.
Note that this implementation is not synchronized. The following can be used to provide synchronized access to your
UnboundedFifoBuffer
:
Buffer fifo = BufferUtils.synchronizedBuffer(new UnboundedFifoBuffer());
This buffer prevents null objects from being added.
This class is Serializable from Commons Collections 3.1.
@author Avalon
@author Federico Barbieri
@author Berin Loritsch
@author Paul Jack
@author Matt Hall, John Watkinson, Stephen Colebourne
@version $Revision: 1.1 $ $Date: 2005/10/11 17:05:20 $
@since Commons Collections 3.0 (previously in main package v2.1)