|
||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--java.util.AbstractCollection | +--org.apache.commons.collections.UnboundedFifoBuffer
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 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 UnboundedFifo
:
Buffer fifo = BufferUtils.synchronizedBuffer(new UnboundedFifo());
This buffer prevents null objects from being added.
Field Summary | |
protected Object[] |
m_buffer
|
protected int |
m_head
|
protected int |
m_tail
|
Constructor Summary | |
UnboundedFifoBuffer()
Constructs an UnboundedFifoBuffer with the default number of elements. |
|
UnboundedFifoBuffer(int size)
Constructs an UnboundedFifoBuffer with the specified number of elements. |
Method Summary | |
boolean |
add(Object o)
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. |
Methods inherited from class java.util.AbstractCollection |
addAll,
clear,
contains,
containsAll,
remove,
removeAll,
retainAll,
toArray,
toArray,
toString |
Methods inherited from class java.lang.Object |
clone,
equals,
finalize,
getClass,
hashCode,
notify,
notifyAll,
wait,
wait,
wait |
Field Detail |
protected Object[] m_buffer
protected int m_head
protected int m_tail
Constructor Detail |
public UnboundedFifoBuffer()
new UnboundedFifoBuffer(32);
public UnboundedFifoBuffer(int size)
Method Detail |
public int size()
public boolean isEmpty()
public boolean add(Object o)
element
- the element to addpublic Object get()
public Object remove()
public Iterator iterator()
|
||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |