AbstractCollection | +--org.apache.commons.collections.buffer.UnboundedFifoBufferAll Implemented Interfaces:
Object[] | UnboundedFifoBuffer is a very efficient buffer implementation. |
int | |
int |
Constructs an UnboundedFifoBuffer with the default number of elements. |
UnboundedFifoBuffer(int initialSize) Constructs an UnboundedFifoBuffer with the specified number of elements. |
boolean | add(final Object obj) Adds the given element to this buffer. |
Object | get() Returns the next object in the buffer. |
boolean | isEmpty() Returns true if this buffer is empty; false otherwise. |
Iterator | iterator() Returns an iterator over this buffer's elements. |
Object | remove() Removes the next object from the buffer |
int | size() Returns the number of elements stored in the buffer. |
protected Object[] buffer
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 remove() and get() operations perform in constant time.
The add(Object) operation performs in amortized constant time. All
other 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.
protected int head
protected int tail
public UnboundedFifoBuffer()
new UnboundedFifoBuffer(32);
public UnboundedFifoBuffer(int initialSize)
- if the size is less than 1public boolean add(final Object obj)
- if the given element is nullpublic Object get()
BufferUnderflowException
- if this buffer is emptypublic boolean isEmpty()
public Iterator iterator()
public Object remove()
BufferUnderflowException
- if this buffer is emptypublic int size()
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 remove() and get() operations perform in constant time. The add(Object) operation performs in amortized constant time. All other operations perform in linear time or worse. Note that this implementation is not synchronized. The following can be used to provide synchronized access to yourUnboundedFifoBuffer
: This buffer prevents null objects from being added.