Class Queues
- java.lang.Object
-
- com.google.common.collect.Queues
-
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static <E> int
drain(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, long timeout, TimeUnit unit)
Drains the queue asBlockingQueue.drainTo(Collection, int)
, but if the requestednumElements
elements are not available, it will wait for them up to the specified timeout.static <E> int
drain(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, Duration timeout)
Drains the queue asBlockingQueue.drainTo(Collection, int)
, but if the requestednumElements
elements are not available, it will wait for them up to the specified timeout.static <E> int
drainUninterruptibly(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, long timeout, TimeUnit unit)
Drains the queue as drain(BlockingQueue, Collection, int, long, TimeUnit), but with a different behavior in case it is interrupted while waiting.static <E> int
drainUninterruptibly(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, Duration timeout)
Drains the queue as drain(BlockingQueue, Collection, int, Duration), but with a different behavior in case it is interrupted while waiting.static <E> ArrayBlockingQueue<E>
newArrayBlockingQueue(int capacity)
Creates an emptyArrayBlockingQueue
with the given (fixed) capacity and nonfair access policy.static <E> ArrayDeque<E>
newArrayDeque()
Creates an emptyArrayDeque
.static <E> ArrayDeque<E>
newArrayDeque(Iterable<? extends E> elements)
Creates anArrayDeque
containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.static <E> ConcurrentLinkedQueue<E>
newConcurrentLinkedQueue()
Creates an emptyConcurrentLinkedQueue
.static <E> ConcurrentLinkedQueue<E>
newConcurrentLinkedQueue(Iterable<? extends E> elements)
Creates aConcurrentLinkedQueue
containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.static <E> LinkedBlockingDeque<E>
newLinkedBlockingDeque()
Creates an emptyLinkedBlockingDeque
with a capacity ofInteger.MAX_VALUE
.static <E> LinkedBlockingDeque<E>
newLinkedBlockingDeque(int capacity)
Creates an emptyLinkedBlockingDeque
with the given (fixed) capacity.static <E> LinkedBlockingDeque<E>
newLinkedBlockingDeque(Iterable<? extends E> elements)
Creates aLinkedBlockingDeque
with a capacity ofInteger.MAX_VALUE
, containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.static <E> LinkedBlockingQueue<E>
newLinkedBlockingQueue()
Creates an emptyLinkedBlockingQueue
with a capacity ofInteger.MAX_VALUE
.static <E> LinkedBlockingQueue<E>
newLinkedBlockingQueue(int capacity)
Creates an emptyLinkedBlockingQueue
with the given (fixed) capacity.static <E> LinkedBlockingQueue<E>
newLinkedBlockingQueue(Iterable<? extends E> elements)
Creates aLinkedBlockingQueue
with a capacity ofInteger.MAX_VALUE
, containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.static <E extends Comparable>
PriorityBlockingQueue<E>newPriorityBlockingQueue()
Creates an emptyPriorityBlockingQueue
with the ordering given by its elements' natural ordering.static <E extends Comparable>
PriorityBlockingQueue<E>newPriorityBlockingQueue(Iterable<? extends E> elements)
Creates aPriorityBlockingQueue
containing the given elements.static <E extends Comparable>
PriorityQueue<E>newPriorityQueue()
Creates an emptyPriorityQueue
with the ordering given by its elements' natural ordering.static <E extends Comparable>
PriorityQueue<E>newPriorityQueue(Iterable<? extends E> elements)
Creates aPriorityQueue
containing the given elements.static <E> SynchronousQueue<E>
newSynchronousQueue()
Creates an emptySynchronousQueue
with nonfair access policy.static <E> Deque<E>
synchronizedDeque(Deque<E> deque)
Returns a synchronized (thread-safe) deque backed by the specified deque.static <E> Queue<E>
synchronizedQueue(Queue<E> queue)
Returns a synchronized (thread-safe) queue backed by the specified queue.
-
-
-
Method Detail
-
newArrayBlockingQueue
@GwtIncompatible public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(int capacity)
Creates an emptyArrayBlockingQueue
with the given (fixed) capacity and nonfair access policy.
-
newArrayDeque
public static <E> ArrayDeque<E> newArrayDeque()
Creates an emptyArrayDeque
.- Since:
- 12.0
-
newArrayDeque
public static <E> ArrayDeque<E> newArrayDeque(Iterable<? extends E> elements)
Creates anArrayDeque
containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.- Since:
- 12.0
-
newConcurrentLinkedQueue
@GwtIncompatible public static <E> ConcurrentLinkedQueue<E> newConcurrentLinkedQueue()
Creates an emptyConcurrentLinkedQueue
.
-
newConcurrentLinkedQueue
@GwtIncompatible public static <E> ConcurrentLinkedQueue<E> newConcurrentLinkedQueue(Iterable<? extends E> elements)
Creates aConcurrentLinkedQueue
containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.
-
newLinkedBlockingDeque
@GwtIncompatible public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque()
Creates an emptyLinkedBlockingDeque
with a capacity ofInteger.MAX_VALUE
.- Since:
- 12.0
-
newLinkedBlockingDeque
@GwtIncompatible public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int capacity)
Creates an emptyLinkedBlockingDeque
with the given (fixed) capacity.- Throws:
IllegalArgumentException
- ifcapacity
is less than 1- Since:
- 12.0
-
newLinkedBlockingDeque
@GwtIncompatible public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(Iterable<? extends E> elements)
Creates aLinkedBlockingDeque
with a capacity ofInteger.MAX_VALUE
, containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.- Since:
- 12.0
-
newLinkedBlockingQueue
@GwtIncompatible public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue()
Creates an emptyLinkedBlockingQueue
with a capacity ofInteger.MAX_VALUE
.
-
newLinkedBlockingQueue
@GwtIncompatible public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(int capacity)
Creates an emptyLinkedBlockingQueue
with the given (fixed) capacity.- Throws:
IllegalArgumentException
- ifcapacity
is less than 1
-
newLinkedBlockingQueue
@GwtIncompatible public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(Iterable<? extends E> elements)
Creates aLinkedBlockingQueue
with a capacity ofInteger.MAX_VALUE
, containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.- Parameters:
elements
- the elements that the queue should contain, in order- Returns:
- a new
LinkedBlockingQueue
containing those elements
-
newPriorityBlockingQueue
@GwtIncompatible public static <E extends Comparable> PriorityBlockingQueue<E> newPriorityBlockingQueue()
Creates an emptyPriorityBlockingQueue
with the ordering given by its elements' natural ordering.- Since:
- 11.0 (requires that
E
beComparable
since 15.0).
-
newPriorityBlockingQueue
@GwtIncompatible public static <E extends Comparable> PriorityBlockingQueue<E> newPriorityBlockingQueue(Iterable<? extends E> elements)
Creates aPriorityBlockingQueue
containing the given elements.Note: If the specified iterable is a
SortedSet
or aPriorityQueue
, this priority queue will be ordered according to the same ordering.- Since:
- 11.0 (requires that
E
beComparable
since 15.0).
-
newPriorityQueue
public static <E extends Comparable> PriorityQueue<E> newPriorityQueue()
Creates an emptyPriorityQueue
with the ordering given by its elements' natural ordering.- Since:
- 11.0 (requires that
E
beComparable
since 15.0).
-
newPriorityQueue
public static <E extends Comparable> PriorityQueue<E> newPriorityQueue(Iterable<? extends E> elements)
Creates aPriorityQueue
containing the given elements.Note: If the specified iterable is a
SortedSet
or aPriorityQueue
, this priority queue will be ordered according to the same ordering.- Since:
- 11.0 (requires that
E
beComparable
since 15.0).
-
newSynchronousQueue
@GwtIncompatible public static <E> SynchronousQueue<E> newSynchronousQueue()
Creates an emptySynchronousQueue
with nonfair access policy.
-
drain
@Beta @CanIgnoreReturnValue @GwtIncompatible public static <E> int drain(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, Duration timeout) throws InterruptedException
Drains the queue asBlockingQueue.drainTo(Collection, int)
, but if the requestednumElements
elements are not available, it will wait for them up to the specified timeout.- Parameters:
q
- the blocking queue to be drainedbuffer
- where to add the transferred elementsnumElements
- the number of elements to be waited fortimeout
- how long to wait before giving up- Returns:
- the number of elements transferred
- Throws:
InterruptedException
- if interrupted while waiting- Since:
- 28.0
-
drain
@Beta @CanIgnoreReturnValue @GwtIncompatible public static <E> int drain(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, long timeout, TimeUnit unit) throws InterruptedException
Drains the queue asBlockingQueue.drainTo(Collection, int)
, but if the requestednumElements
elements are not available, it will wait for them up to the specified timeout.- Parameters:
q
- the blocking queue to be drainedbuffer
- where to add the transferred elementsnumElements
- the number of elements to be waited fortimeout
- how long to wait before giving up, in units ofunit
unit
- aTimeUnit
determining how to interpret the timeout parameter- Returns:
- the number of elements transferred
- Throws:
InterruptedException
- if interrupted while waiting
-
drainUninterruptibly
@Beta @CanIgnoreReturnValue @GwtIncompatible public static <E> int drainUninterruptibly(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, Duration timeout)
Drains the queue as drain(BlockingQueue, Collection, int, Duration), but with a different behavior in case it is interrupted while waiting. In that case, the operation will continue as usual, and in the end the thread's interruption status will be set (noInterruptedException
is thrown).- Parameters:
q
- the blocking queue to be drainedbuffer
- where to add the transferred elementsnumElements
- the number of elements to be waited fortimeout
- how long to wait before giving up- Returns:
- the number of elements transferred
- Since:
- 28.0
-
drainUninterruptibly
@Beta @CanIgnoreReturnValue @GwtIncompatible public static <E> int drainUninterruptibly(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, long timeout, TimeUnit unit)
Drains the queue as drain(BlockingQueue, Collection, int, long, TimeUnit), but with a different behavior in case it is interrupted while waiting. In that case, the operation will continue as usual, and in the end the thread's interruption status will be set (noInterruptedException
is thrown).- Parameters:
q
- the blocking queue to be drainedbuffer
- where to add the transferred elementsnumElements
- the number of elements to be waited fortimeout
- how long to wait before giving up, in units ofunit
unit
- aTimeUnit
determining how to interpret the timeout parameter- Returns:
- the number of elements transferred
-
synchronizedQueue
public static <E> Queue<E> synchronizedQueue(Queue<E> queue)
Returns a synchronized (thread-safe) queue backed by the specified queue. In order to guarantee serial access, it is critical that all access to the backing queue is accomplished through the returned queue.It is imperative that the user manually synchronize on the returned queue when accessing the queue's iterator:
Queue<E> queue = Queues.synchronizedQueue(MinMaxPriorityQueue.<E>create()); ... queue.add(element); // Needn't be in synchronized block ... synchronized (queue) { // Must synchronize on queue! Iterator<E> i = queue.iterator(); // Must be in synchronized block while (i.hasNext()) { foo(i.next()); } }
Failure to follow this advice may result in non-deterministic behavior.
The returned queue will be serializable if the specified queue is serializable.
- Parameters:
queue
- the queue to be wrapped in a synchronized view- Returns:
- a synchronized view of the specified queue
- Since:
- 14.0
-
synchronizedDeque
public static <E> Deque<E> synchronizedDeque(Deque<E> deque)
Returns a synchronized (thread-safe) deque backed by the specified deque. In order to guarantee serial access, it is critical that all access to the backing deque is accomplished through the returned deque.It is imperative that the user manually synchronize on the returned deque when accessing any of the deque's iterators:
Deque<E> deque = Queues.synchronizedDeque(Queues.<E>newArrayDeque()); ... deque.add(element); // Needn't be in synchronized block ... synchronized (deque) { // Must synchronize on deque! Iterator<E> i = deque.iterator(); // Must be in synchronized block while (i.hasNext()) { foo(i.next()); } }
Failure to follow this advice may result in non-deterministic behavior.
The returned deque will be serializable if the specified deque is serializable.
- Parameters:
deque
- the deque to be wrapped in a synchronized view- Returns:
- a synchronized view of the specified deque
- Since:
- 15.0
-
-