public class LIFOLinkedBlockingDeque<T> extends LinkedBlockingDeque<T>
LinkedBlockingDeque
using LIFO algorithmConstructor and Description |
---|
LIFOLinkedBlockingDeque() |
Modifier and Type | Method and Description |
---|---|
boolean |
offer(T e)
Inserts the specified element at the front 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 first element of this deque.
|
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, toString
containsAll, isEmpty, removeAll, retainAll
public boolean offer(T e)
addFirst
method, which can fail to insert an element only by throwing an exception.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 addjava.lang.ClassCastException
- if the class of the specified element
prevents it from being added to this dequejava.lang.NullPointerException
- if the specified element is nulljava.lang.IllegalArgumentException
- if some property of the specified
element prevents it from being added to this dequepublic T remove()
pollFirst
only
in that it throws an exception if this deque is empty.remove
in interface BlockingDeque<T>
remove
in interface Deque<T>
remove
in interface java.util.Queue<T>
remove
in class LinkedBlockingDeque<T>
java.util.NoSuchElementException
- if this deque is empty