E - the type of elements held in this collectionpublic class MpscQueue<E> extends AbstractQueue<E> implements BlockingQueue<E>, Serializable
The optional capacity bound constructor argument serves as a
way to prevent excessive queue expansion. The capacity, if unspecified,
is equal to Integer.MAX_VALUE. Linked nodes are
dynamically created upon each insertion unless this would bring the
queue above capacity.
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.
| 构造器和说明 |
|---|
MpscQueue()
Creates a LinkedBlockingQueue with a capacity of
Integer.MAX_VALUE. |
MpscQueue(Collection<? extends E> c)
Creates a LinkedBlockingQueue with a capacity of
Integer.MAX_VALUE, initially containing the elements of the
given collection,
added in traversal order of the collection's iterator. |
MpscQueue(int capacity)
Creates a LinkedBlockingQueue with the given (fixed) capacity.
|
| 限定符和类型 | 方法和说明 |
|---|---|
void |
clear()
Atomically removes all of the elements from this queue.
|
int |
drainTo(Collection<? super E> c) |
int |
drainTo(Collection<? super E> c,
int maxElements) |
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 if it is
possible to do so immediately without exceeding the queue's capacity,
returning true upon success and false if this queue
is full.
|
boolean |
offer(E e,
long timeout,
TimeUnit unit)
Inserts the specified element at the tail of this queue, waiting if
necessary up to the specified wait time for space to become available.
|
E |
peek() |
E |
poll() |
E |
poll(long timeout,
TimeUnit unit) |
void |
put(E e)
Inserts the specified element at the tail of this queue, waiting if
necessary for space to become available.
|
int |
remainingCapacity()
Returns the number of additional elements that this queue can ideally
(in the absence of memory or resource constraints) accept without
blocking.
|
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.
|
E |
take() |
Object[] |
toArray()
Returns an array containing all of the elements in this queue, in
proper sequence.
|
<T> T[] |
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.
|
String |
toString() |
add, addAll, element, removecontains, containsAll, isEmpty, removeAll, retainAllclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitadd, containsaddAll, containsAll, equals, hashCode, isEmpty, parallelStream, removeAll, removeIf, retainAll, spliterator, streampublic MpscQueue()
Integer.MAX_VALUE.public MpscQueue(int capacity)
capacity - the capacity of this queueIllegalArgumentException - if capacity is not greater
than zeropublic MpscQueue(Collection<? extends E> c)
Integer.MAX_VALUE, initially containing the elements of the
given collection,
added in traversal order of the collection's iterator.c - the collection of elements to initially containNullPointerException - if the specified collection or any
of its elements are nullpublic int size()
size 在接口中 Collection<E>size 在类中 AbstractCollection<E>public int remainingCapacity()
Note that you cannot always tell if an attempt to insert an element will succeed by inspecting remainingCapacity because it may be the case that another thread is about to insert or remove an element.
remainingCapacity 在接口中 BlockingQueue<E>public void put(E e) throws InterruptedException
put 在接口中 BlockingQueue<E>InterruptedExceptionNullPointerExceptionpublic boolean offer(E e, long timeout, TimeUnit unit) throws InterruptedException
offer 在接口中 BlockingQueue<E>InterruptedExceptionNullPointerExceptionpublic boolean offer(E e)
add, which can fail to
insert an element only by throwing an exception.offer 在接口中 BlockingQueue<E>offer 在接口中 Queue<E>NullPointerException - if the specified element is nullpublic E take() throws InterruptedException
take 在接口中 BlockingQueue<E>InterruptedExceptionpublic E poll(long timeout, TimeUnit unit) throws InterruptedException
poll 在接口中 BlockingQueue<E>InterruptedExceptionpublic boolean remove(Object o)
remove 在接口中 Collection<E>remove 在接口中 BlockingQueue<E>remove 在类中 AbstractCollection<E>o - element to be removed from this queue, if presentpublic 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 在接口中 Collection<E>toArray 在类中 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 在接口中 Collection<E>toArray 在类中 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 purposeArrayStoreException - if the runtime type of the specified array
is not a supertype of the runtime type of every element in
this queueNullPointerException - if the specified array is nullpublic String toString()
toString 在类中 AbstractCollection<E>public void clear()
clear 在接口中 Collection<E>clear 在类中 AbstractQueue<E>public int drainTo(Collection<? super E> c)
public int drainTo(Collection<? super E> c, int maxElements)
public 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 在接口中 Iterable<E>iterator 在接口中 Collection<E>iterator 在类中 AbstractCollection<E>Copyright © 2019. All rights reserved.