|
|||||||||
上一个类 下一个类 | 框架 无框架 | ||||||||
摘要: 嵌套 | 字段 | 构造方法 | 方法 | 详细信息: 字段 | 构造方法 | 方法 |
java.lang.Object java.util.AbstractCollection<E> java.util.AbstractQueue<E> org.jboss.netty.util.internal.LinkedTransferQueue<E>
E
- the type of elements held in this collectionpublic class LinkedTransferQueue<E>
An unbounded BlockingQueue
based on linked nodes.
This queue orders elements FIFO (first-in-first-out) with respect
to any given producer. The head of the queue is that
element that has been on the queue the longest time for some
producer. The tail of the queue is that element that has
been on the queue the shortest time for some producer.
Beware that, unlike in most collections, the size
method is NOT a constant-time operation. Because of the
asynchronous nature of these queues, determining the current number
of elements requires a traversal of the elements.
This class and its iterator implement all of the
optional methods of the Collection
and Iterator
interfaces.
Memory consistency effects: As with other concurrent
collections, actions in a thread prior to placing an object into a
LinkedTransferQueue
happen-before
actions subsequent to the access or removal of that element from
the LinkedTransferQueue
in another thread.
This class is a member of the Java Collections Framework.
构造方法摘要 | |
---|---|
LinkedTransferQueue()
Creates an initially empty LinkedTransferQueue . |
|
LinkedTransferQueue(java.util.Collection<? extends E> c)
Creates a LinkedTransferQueue
initially containing the elements of the given collection,
added in traversal order of the collection's iterator. |
方法摘要 | |
---|---|
boolean |
add(E e)
Inserts the specified element at the tail of this queue. |
int |
drainTo(java.util.Collection<? super E> c)
|
int |
drainTo(java.util.Collection<? super E> c,
int maxElements)
|
int |
getWaitingConsumerCount()
|
boolean |
hasWaitingConsumer()
|
boolean |
isEmpty()
Returns true if this queue contains no elements. |
java.util.Iterator<E> |
iterator()
Returns an iterator over the elements in this queue in proper sequence, from head to tail. |
boolean |
offer(E e)
Inserts the specified element at the tail of this queue. |
boolean |
offer(E e,
long timeout,
java.util.concurrent.TimeUnit unit)
Inserts the specified element at the tail of this queue. |
E |
peek()
|
E |
poll()
|
E |
poll(long timeout,
java.util.concurrent.TimeUnit unit)
|
void |
put(E e)
Inserts the specified element at the tail of this queue. |
int |
remainingCapacity()
Always returns Integer.MAX_VALUE because a
LinkedTransferQueue is not capacity constrained. |
boolean |
remove(java.lang.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()
|
void |
transfer(E e)
Transfers the element to a consumer, waiting if necessary to do so. |
boolean |
tryTransfer(E e)
Transfers the element to a waiting consumer immediately, if possible. |
boolean |
tryTransfer(E e,
long timeout,
java.util.concurrent.TimeUnit unit)
Transfers the element to a consumer if it is possible to do so before the timeout elapses. |
从类 java.util.AbstractQueue 继承的方法 |
---|
addAll, clear, element, remove |
从类 java.util.AbstractCollection 继承的方法 |
---|
contains, containsAll, removeAll, retainAll, toArray, toArray, toString |
从类 java.lang.Object 继承的方法 |
---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
从接口 java.util.concurrent.BlockingQueue 继承的方法 |
---|
contains |
从接口 java.util.Queue 继承的方法 |
---|
element, remove |
从接口 java.util.Collection 继承的方法 |
---|
addAll, clear, containsAll, equals, hashCode, removeAll, retainAll, toArray, toArray |
构造方法详细信息 |
---|
public LinkedTransferQueue()
LinkedTransferQueue
.
public LinkedTransferQueue(java.util.Collection<? extends E> c)
LinkedTransferQueue
initially containing the elements of the given collection,
added in traversal order of the collection's iterator.
c
- the collection of elements to initially contain
java.lang.NullPointerException
- if the specified collection or any
of its elements are null方法详细信息 |
---|
public void put(E e)
java.util.concurrent.BlockingQueue<E>
中的 put
java.lang.NullPointerException
- if the specified element is nullpublic boolean offer(E e, long timeout, java.util.concurrent.TimeUnit unit)
false
.
java.util.concurrent.BlockingQueue<E>
中的 offer
true
(as specified by
BlockingQueue.offer
)
java.lang.NullPointerException
- if the specified element is nullpublic boolean offer(E e)
false
.
java.util.concurrent.BlockingQueue<E>
中的 offer
java.util.Queue<E>
中的 offer
true
(as specified by
BlockingQueue.offer
)
java.lang.NullPointerException
- if the specified element is nullpublic boolean add(E e)
IllegalStateException
or return false
.
java.util.Collection<E>
中的 add
java.util.concurrent.BlockingQueue<E>
中的 add
java.util.Queue<E>
中的 add
java.util.AbstractQueue<E>
中的 add
true
(as specified by Collection.add(E)
)
java.lang.NullPointerException
- if the specified element is nullpublic boolean tryTransfer(E e)
More precisely, transfers the specified element immediately
if there exists a consumer already waiting to receive it (in
take()
or timed poll
),
otherwise returning false
without enqueuing the element.
java.lang.NullPointerException
- if the specified element is nullpublic void transfer(E e) throws java.lang.InterruptedException
More precisely, transfers the specified element immediately
if there exists a consumer already waiting to receive it (in
take()
or timed poll
),
else inserts the specified element at the tail of this queue
and waits until the element is received by a consumer.
java.lang.NullPointerException
- if the specified element is null
java.lang.InterruptedException
public boolean tryTransfer(E e, long timeout, java.util.concurrent.TimeUnit unit) throws java.lang.InterruptedException
More precisely, transfers the specified element immediately
if there exists a consumer already waiting to receive it (in
take()
or timed poll
),
else inserts the specified element at the tail of this queue
and waits until the element is received by a consumer,
returning false
if the specified wait time elapses
before the element can be transferred.
java.lang.NullPointerException
- if the specified element is null
java.lang.InterruptedException
public E take() throws java.lang.InterruptedException
java.util.concurrent.BlockingQueue<E>
中的 take
java.lang.InterruptedException
public E poll(long timeout, java.util.concurrent.TimeUnit unit) throws java.lang.InterruptedException
java.util.concurrent.BlockingQueue<E>
中的 poll
java.lang.InterruptedException
public E poll()
java.util.Queue<E>
中的 poll
public int drainTo(java.util.Collection<? super E> c)
java.util.concurrent.BlockingQueue<E>
中的 drainTo
java.lang.NullPointerException
java.lang.IllegalArgumentException
public int drainTo(java.util.Collection<? super E> c, int maxElements)
java.util.concurrent.BlockingQueue<E>
中的 drainTo
java.lang.NullPointerException
java.lang.IllegalArgumentException
public java.util.Iterator<E> iterator()
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.
java.lang.Iterable<E>
中的 iterator
java.util.Collection<E>
中的 iterator
java.util.AbstractCollection<E>
中的 iterator
public E peek()
java.util.Queue<E>
中的 peek
public boolean isEmpty()
true
if this queue contains no elements.
java.util.Collection<E>
中的 isEmpty
java.util.AbstractCollection<E>
中的 isEmpty
true
if this queue contains no elementspublic boolean hasWaitingConsumer()
public int size()
Integer.MAX_VALUE
elements, returns
Integer.MAX_VALUE
.
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.
java.util.Collection<E>
中的 size
java.util.AbstractCollection<E>
中的 size
public int getWaitingConsumerCount()
public boolean remove(java.lang.Object o)
e
such
that o.equals(e)
, if this queue contains one or more such
elements.
Returns true
if this queue contained the specified element
(or equivalently, if this queue changed as a result of the call).
java.util.Collection<E>
中的 remove
java.util.concurrent.BlockingQueue<E>
中的 remove
java.util.AbstractCollection<E>
中的 remove
o
- element to be removed from this queue, if present
true
if this queue changed as a result of the callpublic int remainingCapacity()
Integer.MAX_VALUE
because a
LinkedTransferQueue
is not capacity constrained.
java.util.concurrent.BlockingQueue<E>
中的 remainingCapacity
Integer.MAX_VALUE
(as specified by
BlockingQueue.remainingCapacity()
)
|
|||||||||
上一个类 下一个类 | 框架 无框架 | ||||||||
摘要: 嵌套 | 字段 | 构造方法 | 方法 | 详细信息: 字段 | 构造方法 | 方法 |