com.nostra13.universalimageloader.core.assist.deque

类 LIFOLinkedBlockingDeque<T>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractQueue<E>

com.nostra13.universalimageloader.core.assist.deque.LinkedBlockingDeque<T>

com.nostra13.universalimageloader.core.assist.deque.LIFOLinkedBlockingDeque<T>

所有已实现的接口:

BlockingDeque<T>, Deque<T>, Serializable, Iterable<T>, Collection<T>, BlockingQueue<T>, Queue<T>

public class LIFOLinkedBlockingDeque<T>
extends LinkedBlockingDeque<T>

LinkedBlockingDeque using LIFO algorithm

从以下版本开始:

1.6.3

另请参阅:

序列化表格

构造器概要

构造器

构造器和说明
LIFOLinkedBlockingDeque()

方法概要

限定符和类型	方法和说明
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.

从类继承的方法 com.nostra13.universalimageloader.core.assist.deque.LinkedBlockingDeque

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

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

addAll

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

containsAll, isEmpty, removeAll, retainAll

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

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

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

addAll, containsAll, equals, hashCode, isEmpty, parallelStream, removeAll, removeIf, retainAll, spliterator, stream

从接口继承的方法 java.lang.Iterable

forEach

构造器详细资料

LIFOLinkedBlockingDeque

public LIFOLinkedBlockingDeque()

方法详细资料

offer

public 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. When using a capacity-restricted deque, this method is generally preferable to the addFirst method, which can fail to insert an element only by throwing an exception.

指定者:

offer 在接口中 BlockingDeque<T>

指定者:

offer 在接口中 Deque<T>

指定者:

offer 在接口中 BlockingQueue<T>

指定者:

offer 在接口中 Queue<T>

覆盖:

offer 在类中 LinkedBlockingDeque<T>

参数:

e - the element to add

返回:

true if the element was added to this deque, else false

抛出:

ClassCastException - if the class of the specified element prevents it from being added to this deque

NullPointerException - if the specified element is null

IllegalArgumentException - if some property of the specified element prevents it from being added to this deque

remove

public T remove()

Retrieves and removes the first element of this deque. This method differs from pollFirst only in that it throws an exception if this deque is empty.

指定者:

remove 在接口中 BlockingDeque<T>

指定者:

remove 在接口中 Deque<T>

指定者:

remove 在接口中 Queue<T>

覆盖:

remove 在类中 LinkedBlockingDeque<T>

返回:

the head of this deque

抛出:

NoSuchElementException - if this deque is empty