public static class DefaultImageTaskExecutor.LinkedBlockingStack<T> extends LinkedBlockingDeque<T>
| Constructor and Description |
|---|
DefaultImageTaskExecutor.LinkedBlockingStack() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
offer(T e)
Inserts the specified element into the queue represented by this deque
(in other words, at the tail of this deque) if it is possible to do so
immediately without violating capacity restrictions, returning
true upon success and false if no space is currently
available.
|
T |
remove()
Retrieves and removes the head of the queue represented by this deque.
|
void |
setTaskOrder(int order) |
add, addFirst, addLast, clear, contains, descendingIterator, drainTo, drainTo, element, getFirst, getLast, iterator, offer, offerFirst, offerFirst, offerLast, offerLast, peek, peekFirst, peekLast, poll, poll, pollFirst, pollFirst, pollLast, pollLast, pop, push, put, putFirst, putLast, remainingCapacity, remove, removeFirst, removeFirstOccurrence, removeLast, removeLastOccurrence, size, take, takeFirst, takeLast, toArray, toArray, toStringcontainsAll, isEmpty, removeAll, retainAllpublic DefaultImageTaskExecutor.LinkedBlockingStack()
public void setTaskOrder(int order)
public boolean offer(T e)
BlockingDequeBlockingDeque.add(E) method, which can fail to
insert an element only by throwing an exception.
This method is equivalent to offerLast.
offer in interface BlockingDeque<T>offer in interface Deque<T>offer in interface java.util.concurrent.BlockingQueue<T>offer in interface java.util.Queue<T>offer in class LinkedBlockingDeque<T>e - the element to addpublic T remove()
LinkedBlockingDequepoll only in that it throws an
exception if this deque is empty.
This method is equivalent to removeFirst.
remove in interface BlockingDeque<T>remove in interface Deque<T>remove in interface java.util.Queue<T>remove in class LinkedBlockingDeque<T>