The removal order can be based on insertion order (eg, a FIFO queue or a LIFO stack), on access order (eg, an LRU cache), on some arbitrary comparator (eg, a priority queue) or on any other well-defined ordering.
Note that the removal order is not necessarily the same as the iteration order. A Buffer
implementation may have equivalent removal and iteration orders, but this is not required.
This interface does not specify any behavior for {@link Object#equals(Object)} and {@link Object#hashCode} methods. Itis therefore possible for a Buffer
implementation to also also implement {@link java.util.List}, {@link java.util.Set} or {@link Bag}.
@since Commons Collections 2.1
@version $Revision: 1.10 $ $Date: 2004/02/18 01:15:42 $
@author Avalon
@author Berin Loritsch
@author Paul Jack
@author Stephen Colebourne
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|