org.jboss.netty.util.internal
类 LinkedTransferQueue<E>

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 collection
所有已实现的接口:
java.io.Serializable, java.lang.Iterable<E>, java.util.Collection<E>, java.util.concurrent.BlockingQueue<E>, java.util.Queue<E>

public class LinkedTransferQueue<E>
extends java.util.AbstractQueue<E>
implements java.util.concurrent.BlockingQueue<E>, java.io.Serializable

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
 

构造方法详细信息

LinkedTransferQueue

public LinkedTransferQueue()
Creates an initially empty LinkedTransferQueue.


LinkedTransferQueue

public 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.

参数:
c - the collection of elements to initially contain
抛出:
java.lang.NullPointerException - if the specified collection or any of its elements are null
方法详细信息

put

public void put(E e)
Inserts the specified element at the tail of this queue. As the queue is unbounded, this method will never block.

指定者:
接口 java.util.concurrent.BlockingQueue<E> 中的 put
抛出:
java.lang.NullPointerException - if the specified element is null

offer

public boolean offer(E e,
                     long timeout,
                     java.util.concurrent.TimeUnit unit)
Inserts the specified element at the tail of this queue. As the queue is unbounded, this method will never block or return false.

指定者:
接口 java.util.concurrent.BlockingQueue<E> 中的 offer
返回:
true (as specified by BlockingQueue.offer)
抛出:
java.lang.NullPointerException - if the specified element is null

offer

public boolean offer(E e)
Inserts the specified element at the tail of this queue. As the queue is unbounded, this method will never return 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 null

add

public boolean add(E e)
Inserts the specified element at the tail of this queue. As the queue is unbounded, this method will never throw 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 null

tryTransfer

public boolean tryTransfer(E e)
Transfers the element to a waiting consumer immediately, if possible.

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 null

transfer

public void transfer(E e)
              throws java.lang.InterruptedException
Transfers the element to a consumer, waiting if necessary to do so.

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

tryTransfer

public boolean tryTransfer(E e,
                           long timeout,
                           java.util.concurrent.TimeUnit unit)
                    throws java.lang.InterruptedException
Transfers the element to a consumer if it is possible to do so before the timeout elapses.

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

take

public E take()
       throws java.lang.InterruptedException
指定者:
接口 java.util.concurrent.BlockingQueue<E> 中的 take
抛出:
java.lang.InterruptedException

poll

public E poll(long timeout,
              java.util.concurrent.TimeUnit unit)
       throws java.lang.InterruptedException
指定者:
接口 java.util.concurrent.BlockingQueue<E> 中的 poll
抛出:
java.lang.InterruptedException

poll

public E poll()
指定者:
接口 java.util.Queue<E> 中的 poll

drainTo

public int drainTo(java.util.Collection<? super E> c)
指定者:
接口 java.util.concurrent.BlockingQueue<E> 中的 drainTo
抛出:
java.lang.NullPointerException
java.lang.IllegalArgumentException

drainTo

public int drainTo(java.util.Collection<? super E> c,
                   int maxElements)
指定者:
接口 java.util.concurrent.BlockingQueue<E> 中的 drainTo
抛出:
java.lang.NullPointerException
java.lang.IllegalArgumentException

iterator

public java.util.Iterator<E> iterator()
Returns an iterator over the elements in this queue in proper sequence, from head to tail.

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
返回:
an iterator over the elements in this queue in proper sequence

peek

public E peek()
指定者:
接口 java.util.Queue<E> 中的 peek

isEmpty

public boolean isEmpty()
Returns true if this queue contains no elements.

指定者:
接口 java.util.Collection<E> 中的 isEmpty
覆盖:
java.util.AbstractCollection<E> 中的 isEmpty
返回:
true if this queue contains no elements

hasWaitingConsumer

public boolean hasWaitingConsumer()

size

public int size()
Returns the number of elements in this queue. If this queue contains more than 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
返回:
the number of elements in this queue

getWaitingConsumerCount

public int getWaitingConsumerCount()

remove

public boolean remove(java.lang.Object o)
Removes a single instance of the specified element from this queue, if it is present. More formally, removes an element 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 call

remainingCapacity

public int remainingCapacity()
Always returns Integer.MAX_VALUE because a LinkedTransferQueue is not capacity constrained.

指定者:
接口 java.util.concurrent.BlockingQueue<E> 中的 remainingCapacity
返回:
Integer.MAX_VALUE (as specified by BlockingQueue.remainingCapacity())