com.fr.third.jgroups.util

类 ConcurrentLinkedBlockingQueue<T>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractQueue<E>

java.util.concurrent.ConcurrentLinkedQueue<T>

com.fr.third.jgroups.util.ConcurrentLinkedBlockingQueue<T>

所有已实现的接口:

java.io.Serializable, java.lang.Iterable<T>, java.util.Collection<T>, java.util.concurrent.BlockingQueue<T>, java.util.Queue<T>

public class ConcurrentLinkedBlockingQueue<T>
extends java.util.concurrent.ConcurrentLinkedQueue<T>
implements java.util.concurrent.BlockingQueue<T>

Attempt at writing a fast transfer queue, which is bounded. The take() method blocks until there is an element, but the offer() method drops the element and returns if the queue is full (doesn't block). I thought this class would be useful in ThreadPoolExecutor, as a replacement for LinkedBlockingQueue, but the perf didn't change. I'll keep it for later reference ...

作者:

Bela Ban

另请参阅:

序列化表格

构造器概要

构造器

构造器和说明
ConcurrentLinkedBlockingQueue(int capacity)

方法概要

方法

限定符和类型	方法和说明
int	drainTo(java.util.Collection<? super T> c)
int	drainTo(java.util.Collection<? super T> c, int maxElements)
boolean	offer(T t) Drops elements if capacity has been reached.
boolean	offer(T t, long timeout, java.util.concurrent.TimeUnit unit)
T	poll()
T	poll(long timeout, java.util.concurrent.TimeUnit unit)
void	put(T t)
int	remainingCapacity()
boolean	remove(java.lang.Object o)
T	take()

从类继承的方法 java.util.concurrent.ConcurrentLinkedQueue

add, addAll, contains, isEmpty, iterator, peek, size, toArray, toArray

从类继承的方法 java.util.AbstractQueue

clear, element, remove

从类继承的方法 java.util.AbstractCollection

containsAll, removeAll, retainAll, toString

从类继承的方法 java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

从接口继承的方法 java.util.concurrent.BlockingQueue

add, contains

从接口继承的方法 java.util.Queue

element, peek, remove

从接口继承的方法 java.util.Collection

addAll, clear, containsAll, equals, hashCode, isEmpty, iterator, removeAll, retainAll, size, toArray, toArray

构造器详细资料

ConcurrentLinkedBlockingQueue

public ConcurrentLinkedBlockingQueue(int capacity)

方法详细资料

offer

public boolean offer(T t)

Drops elements if capacity has been reached. That's OK for the ThreadPoolExecutor as dropped messages will get retransmitted

指定者:

offer 在接口中 java.util.concurrent.BlockingQueue<T>

指定者:

offer 在接口中 java.util.Queue<T>

覆盖:

offer 在类中 java.util.concurrent.ConcurrentLinkedQueue<T>

参数:

t -

返回:

take

public T take()
       throws java.lang.InterruptedException

指定者:

take 在接口中 java.util.concurrent.BlockingQueue<T>

抛出:

java.lang.InterruptedException

poll

public T poll()

指定者:

poll 在接口中 java.util.Queue<T>

覆盖:

poll 在类中 java.util.concurrent.ConcurrentLinkedQueue<T>

poll

public T poll(long timeout,
     java.util.concurrent.TimeUnit unit)
       throws java.lang.InterruptedException

指定者:

poll 在接口中 java.util.concurrent.BlockingQueue<T>

抛出:

java.lang.InterruptedException

remove

public boolean remove(java.lang.Object o)

指定者:

remove 在接口中 java.util.Collection<T>

指定者:

remove 在接口中 java.util.concurrent.BlockingQueue<T>

覆盖:

remove 在类中 java.util.concurrent.ConcurrentLinkedQueue<T>

remainingCapacity

public int remainingCapacity()

指定者:

remainingCapacity 在接口中 java.util.concurrent.BlockingQueue<T>

drainTo

public int drainTo(java.util.Collection<? super T> c)

指定者:

drainTo 在接口中 java.util.concurrent.BlockingQueue<T>

put

public void put(T t)
         throws java.lang.InterruptedException

指定者:

put 在接口中 java.util.concurrent.BlockingQueue<T>

抛出:

java.lang.InterruptedException

offer

public boolean offer(T t,
            long timeout,
            java.util.concurrent.TimeUnit unit)
              throws java.lang.InterruptedException

指定者:

offer 在接口中 java.util.concurrent.BlockingQueue<T>

抛出:

java.lang.InterruptedException

drainTo

public int drainTo(java.util.Collection<? super T> c,
          int maxElements)

指定者:

drainTo 在接口中 java.util.concurrent.BlockingQueue<T>