The removal order of a {@link CircularFifoQueue} is based on theinsertion 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 #add(Object)}, {@link #remove()}, {@link #peek()}, {@link #poll}, {@link #offer(Object)} operations all perform in constant time.All other operations perform in linear time or worse.
This queue prevents null objects from being added. @since 4.0 @version $Id: CircularFifoQueue.java 1477765 2013-04-30 18:37:37Z tn $
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|