is new.
java.lang.Objectjava.util.AbstractCollection<E>
java.util.AbstractQueue<E>
java.util.concurrent.DelayQueue<E>
public class DelayQueue<E extends Delayed>
An unbounded
blocking queue
of
Delayed
elements, in which an element can only be taken when its delay has expired. The head of the queue is that
Delayed
element whose delay expired furthest in the past. If no delay has expired there is no head and
poll
will return
null
. Expiration occurs when an element's
getDelay(TimeUnit.NANOSECONDS)
method returns a value less than or equal to zero.
Even though unexpired elements cannot be removed using
This queue does not permit
take
null
or
poll
, they are otherwise treated as normal elements. For example, the
size
method returns the count of both expired and unexpired elements. This queue does not permit null elements.
elements.
This class and its iterator implement all of the optional methods of the Collection and Iterator interfaces.
This class is a member of the Java Collections Framework .
| Constructor Summary | |
|---|---|
|
DelayQueue
() Creates a new DelayQueue that is initially empty. |
|
|
DelayQueue
(
Collection
<? extends
E
> c) Creates a DelayQueue initially containing the elements of the given collection of Delayed instances. |
|
| Method Summary | ||
|---|---|---|
| boolean |
add
(
E
Inserts
into
delay
queue. |
|
| void |
clear
() Atomically removes all of the elements from this delay queue. |
|
| int |
drainTo
(
Collection
<? super
E
Removes all available elements from this queue and adds them
to
|
|
| int |
drainTo
(
Collection
<? super
E
Removes at most the given number of available elements from this queue and adds them
to
|
|
| Iterator < E |
iterator
() Returns an iterator over
all
the elements
(both expired and unexpired)
in this queue. |
|
| boolean |
offer
(
E
Inserts the specified element into this delay queue. |
|
| boolean |
offer
(
E
e,
Inserts the specified element into this delay queue. |
|
| E |
peek
() Retrieves, but does not remove, the head of this queue,
or returns
is empty.
|
|
| E |
poll
() Retrieves and removes the head of this queue, or
returns
null
if this queue has no elements with an
expired
|
|
| E |
poll
(long timeout,
TimeUnit
Retrieves and removes the head of this queue, waiting if necessary
until an element
expired
is available
queue, or the specified wait time expires.
|
|
| void |
put
(
E
Inserts
into
|
|
| int |
remainingCapacity
() Always returns Integer.MAX_VALUE because a DelayQueue is not capacity constrained. |
|
| boolean |
remove
(
Object
Removes a single instance of the specified element from this queue, if it is
present, whether or not it has expired.
|
|
| int |
size
() Returns the number of elements in this collection. |
|
| E |
take
() Retrieves and removes the head of this queue, waiting if
necessary until an element
expired
is available
|
|
| Object |
toArray
() Returns an array containing all of the elements in this
queue.
|
|
|
toArray
(T[] a)
Returns an array containing all of the elements in this
queue;
|
|
| Methods inherited from class java.util. AbstractQueue |
|---|
| addAll , element , remove |
| Methods inherited from class java.util. AbstractCollection |
|---|
| contains , containsAll , isEmpty , removeAll , retainAll , toString |
| Methods inherited from class java.lang. Object |
|---|
| clone , equals , finalize , getClass , hashCode , notify , notifyAll , wait , wait , wait |
Methods inherited from interface java.util.concurrent.
BlockingQueue
|
|---|
contains
|
| Methods inherited from interface java.util. Queue |
|---|
| element , remove |
| Methods inherited from interface java.util. Collection |
|---|
addAll
,
|
| Constructor Detail |
|---|
public DelayQueue()
public DelayQueue(Collection<? extends E> c)
of elements to initially contain
- if the specified collection or any of its elements are null
| Method Detail |
|---|
add
public booleanadd
offer(Ee)
o)
add
in interface
Collection
<
E
extends
Delayed
>
Specified by:
add
in interface
BlockingQueue
<
E
extends
Delayed
>
add
Overrides:
add
in class
AbstractQueue
<
E
extends
Delayed
>
e
(as specified by
Collection.add(E)
)
offer
publicboolean
voidoffer
put(Ee)
o)
Inserts the specified element into this delay queue.
offer
Specified by:
offer
in interface
Queue
<
E
extends
Delayed
>
e
Returns:
true
put
publicvoid
booleanput
offer(Ee)
o, long timeout,TimeUnitunit)
put
e - the element to add
offer
public booleanoffer
add(Ee, long timeout,
TimeUnit
unit)
o)
Inserts the specified element into this delay queue. As the queue is unbounded this method will never block.
offer
e - the element to add
timeout - This parameter is ignored as the method never blocks
unit - This parameter is ignored as the method never blocks
poll
public Epoll
take()
() throwsInterruptedException
or returns
null
this queue has
no elements with an
expired delay.
poll
Queue
the head of this queue, or
null
if this queue has no elements with an expired delay
take
public Etake
poll() throws
InterruptedException
(long timeout,TimeUnitunit) throwsInterruptedException
until an element
expired
is available
take
the head of this queue
waiting
public Epoll(long timeout,
TimeUnit
unit) throws
InterruptedException
()
Retrieves and removes the head of this queue, waiting if necessary until an element with an expired delay is available on this queue, or the specified wait time expires.
poll
BlockingQueue
Parameters:
timeout - how long to wait before giving up, in units of
unit
unit - a
TimeUnit
determining how to interpret the
timeout
parameter
if the specified waiting time elapses before an element with an expired delay becomes available
Throws:
InterruptedException
- if interrupted while waiting
public E peek()
or returns
if this queue is empty. Unlike
poll
, if no expired elements are available in the queue, this method returns the element that will expire next, if one exists.
if this queue is empty.
public int size()
interface:
Collection
this
collection
public int drainTo(Collection<? super E> c)
to
add elements to collection
the number of elements transferred
Throws:
UnsupportedOperationException
- if addition of elements is not supported by the specified collection
ClassCastException
- if the class of an element of this queue prevents it from being added to the specified collection
NullPointerException
- if the specified collection is null
IllegalArgumentException
- if the specified collection is this queue, or some property of an element of this queue prevents it from being added to the specified collection
public int drainTo(Collection<? super E> c,
int maxElements)
to
add elements to collection
the number of elements transferred
Throws:
UnsupportedOperationException
- if addition of elements is not supported by the specified collection
ClassCastException
- if the class of an element of this queue prevents it from being added to the specified collection
NullPointerException
- if the specified collection is null
IllegalArgumentException
- if the specified collection is this queue, or some property of an element of this queue prevents it from being added to the specified collection
public void clear()
Elements with an unexpired delay are not waited for; they are simply discarded from the queue.
public int remainingCapacity()
public Object[] toArray()
queue. The
array
are
in
no particular
The returned array will be "safe" in that no references to it are maintained by
this queue.
the collection.
(In other words, this method must allocate a new
array).
array even if the collection is backed by an Array).
The caller is thus free to modify the returned array.
This method acts as bridge between array-based and collection-based APIs.
This implementation allocates the array to be returned, and iterates over the elements in the collection, storing each object reference in the next consecutive element of the array, starting with element 0.
queue
public <T> T[] toArray(T[] a)
(T[] array)
queue;
The returned array elements are in no particular order.
If the
queue
queue.
If
this queue
the collection
fits in the specified array with room to spare (i.e., the array has more elements than
this queue),
the
collection), the
element in the array immediately following the end of the
queue
collection
is set to
null
.
This is useful in determining the length of the collection
only
if the caller knows that the collection does not contain any
null
elements.)
Like the
toArray()
method, this method acts as bridge between array-based and collection-based APIs. Further, this method allows precise control over the runtime type of the output array, and may, under certain circumstances, be used to save allocation costs.
If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.
The following code can be used to dump a delay queue into a newly allocated array of
This implementation checks if the array is large enough to contain the collection; if not, it allocates a new array of the correct size and type (using reflection). Then, it iterates over the collection, storing each object reference in the next consecutive element of the array, starting with element 0. If the array is larger than the collection, a
Delayed
null
:
Delayed[] a = q.toArray(new Delayed[0]);
Note that
toArray(new Object[0])
is identical in function to
toArray()
.
a
queue
purpose
an array containing all of the elements in this queue
Throws:
ArrayStoreException
- if the runtime type of the specified array is not a supertype of the runtime type of every element in this queue
NullPointerException
- if the specified array is null
public boolean remove(Object o)
present, whether or not it has expired.
Specified by:
remove
in interface
BlockingQueue
<
E
extends
Delayed
>
present
if an element was removed as a result of this call
public Iterator<E> iterator()
all
the elements
(both expired and unexpired)
in this queue. The iterator does not return the elements in any particular order. The returned iterator is a thread-safe "fast-fail" iterator that will throw
ConcurrentModificationException
upon detected interference.
queue