|
Préférences
Moteurs de recherche
|
||||||||||||||||||||||||||||||||||||||||
JavaTM 2 Platform Std. Ed. v1.6.0
java.util.concurrent
|
Constructor Summary | |
---|---|
ConcurrentLinkedQueue()
Creates a ConcurrentLinkedQueue that is initially empty. |
|
ConcurrentLinkedQueue(Collection<? extends E> c)
Creates a ConcurrentLinkedQueue initially containing the elements of the given collection, added in traversal order of the collection's iterator. |
Method Summary | ||
---|---|---|
boolean |
add(E e)
Inserts the specified element at the tail of this queue. |
|
boolean |
contains(Object o)
Returns true if this queue contains the specified element. |
|
boolean |
isEmpty()
Returns true if this queue contains no elements. |
|
Iterator<E> |
iterator()
Returns an iterator over the elements in this queue in proper sequence. |
|
boolean |
offer(E e)
Inserts the specified element at the tail of this queue. |
|
E |
peek()
Retrieves, but does not remove, the head of this queue, or returns null if this queue is empty. |
|
E |
poll()
Retrieves and removes the head of this queue, or returns null if this queue is empty. |
|
boolean |
remove(Object o)
Removes a single instance of the specified element from this queue, if it is present. |
|
int |
size()
Returns the number of elements in this queue. |
|
Object[] |
toArray()
Returns an array containing all of the elements in this queue, in proper sequence. |
|
|
toArray(T[] a)
Returns an array containing all of the elements in this queue, in proper sequence; the runtime type of the returned array is that of the specified array. |
Methods inherited from class java.util.AbstractQueue |
---|
addAll, clear, element, remove |
Methods inherited from class java.util.AbstractCollection |
---|
containsAll, 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.Queue |
---|
element, remove |
Methods inherited from interface java.util.Collection |
---|
addAll, clear, containsAll, equals, hashCode, removeAll, retainAll |
Constructor Detail |
---|
public ConcurrentLinkedQueue()
public ConcurrentLinkedQueue(Collection<? extends E> c)
c
- the collection of elements to initially contain
NullPointerException
- if the specified collection or any
of its elements are nullMethod Detail |
---|
public boolean add(E e)
add
in interface Collection<E>
add
in interface Queue<E>
add
in class AbstractQueue<E>
e
- the element to add
Collection.add(E)
)
NullPointerException
- if the specified element is nullpublic boolean offer(E e)
e
- the element to add
Queue.offer(E)
)
NullPointerException
- if the specified element is nullpublic E poll()
Queue
public E peek()
Queue
public boolean isEmpty()
isEmpty
in interface Collection<E>
isEmpty
in class AbstractCollection<E>
public int size()
Beware that, unlike in most collections, this method is NOT a constant-time operation. Because of the asynchronous nature of these queues, determining the current number of elements requires an O(n) traversal.
size
in interface Collection<E>
size
in class AbstractCollection<E>
public boolean contains(Object o)
contains
in interface Collection<E>
contains
in class AbstractCollection<E>
o
- object to be checked for containment in this queue
public boolean remove(Object o)
remove
in interface Collection<E>
remove
in class AbstractCollection<E>
o
- element to be removed from this queue, if present
public Object[] toArray()
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.
toArray
in interface Collection<E>
toArray
in class AbstractCollection<E>
public <T> T[] toArray(T[] a)
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 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.
Suppose x is a queue known to contain only strings. The following code can be used to dump the queue into a newly allocated array of String:
String[] y = x.toArray(new String[0]);Note that toArray(new Object[0]) is identical in function to toArray().
toArray
in interface Collection<E>
toArray
in class AbstractCollection<E>
a
- the array into which the elements of the queue are to
be stored, if it is big enough; otherwise, a new array of the
same runtime type is allocated for this purpose
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 nullpublic Iterator<E> iterator()
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.
iterator
in interface Iterable<E>
iterator
in interface Collection<E>
iterator
in class AbstractCollection<E>