| public class java.util.concurrent DelayQueue<E>
|
Java SE 6 |
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.
| since | 1.5 |
| E | the type of elements held in this collection |
| Constructors | |||||
|---|---|---|---|---|---|
| public | DelayQueue() Creates a new DelayQueue that is initially empty. | ||||
| public | DelayQueue(Collection c) Creates a DelayQueue initially containing the elements of the given collection of Delayed instances.
| ||||
| Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| public boolean | add(Delayed e) Inserts the specified element into this delay queue.
| ||||||||||
| public void | clear() Atomically removes all of the elements from this delay queue. The queue will be empty after this call returns. Elements with an unexpired delay are not waited for; they are simply discarded from the queue. | ||||||||||
| public int | drainTo(Collection c)
| ||||||||||
| public int | drainTo(Collection c, int maxElements)
| ||||||||||
| public Iterator | iterator() Returns an iterator over 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 "weakly consistent" iterator that will never throw ConcurrentModificationException, and
guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed
to) reflect any modifications subsequent to construction.
| ||||||||||
| public boolean | offer(Delayed e) Inserts the specified element into this delay queue.
| ||||||||||
| public boolean | offer(Delayed e, long timeout, TimeUnit unit) Inserts the specified element into this delay queue. As the queue is unbounded this method will never block.
| ||||||||||
| public Delayed | peek() Retrieves, but does not remove, the head of this queue, or returns null 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.
| ||||||||||
| public Delayed | poll() Retrieves and removes the head of this queue, or returns null if this queue has no elements with an expired delay.
| ||||||||||
| public Delayed | poll(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.
| ||||||||||
| public void | put(Delayed e) Inserts the specified element into this delay queue. As the queue is unbounded this method will never block.
| ||||||||||
| public int | remainingCapacity() Always returns Integer.MAX_VALUE because a DelayQueue is not capacity constrained.
| ||||||||||
| public boolean | remove(Object o) Removes a single instance of the specified element from this queue, if it is present, whether or not it has expired. | ||||||||||
| public int | size() | ||||||||||
| public Delayed | take() 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.
| ||||||||||
| public Object[] | toArray() Returns an array containing all of the elements in this queue. The returned array elements are in no particular order. The returned array will be "safe" in that no references to it are maintained by this queue. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array. This method acts as bridge between array-based and collection-based APIs.
| ||||||||||
| public Object[]<T> | toArray(Object[] a) Returns an array containing all of the elements in this queue; the runtime type of the returned array is that of the specified array. The returned array elements are in no particular order. If the queue fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this queue. If this queue fits in the specified array with room to spare (i.e., the array has more elements than this queue), the element in the array immediately following the end of the queue is set to null. Like the The following code can be used to dump a delay queue into a newly allocated array of Delayed:
Delayed[] a = q.toArray(new Delayed[0]);
Note that toArray(new Object[0]) is identical in function to
toArray().
| ||||||||||
| About DocWeb · Bundles · Export · Export All | Top 10 · Statistics · Login |
| About Sun · Contact · Privacy · Terms of Use · Trademarks | Java SE 6 · Copyright © 1994-2009 Sun Microsystems, Inc.All rights reserved. Use is subject to license terms |
![]() |
![]() |
|