org.dromara.hutool.core.collection.queue

类 LinkedDeque<E extends Linked<E>>

java.lang.Object

java.util.AbstractCollection<E>

org.dromara.hutool.core.collection.queue.LinkedDeque<E>

类型参数:

E - the type of elements held in this collection

所有已实现的接口:

Iterable<E>, Collection<E>, Deque<E>, Queue<E>

public class LinkedDeque<E extends Linked<E>>
extends AbstractCollection<E>
implements Deque<E>

Linked list implementation of the Deque interface where the link pointers are tightly integrated with the element. Linked deques have no capacity restrictions; they grow as necessary to support usage. They are not thread-safe; in the absence of external synchronization, they do not support concurrent access by multiple threads. Null elements are prohibited.

Most LinkedDeque operations run in constant time by assuming that the Linked parameter is associated with the deque instance. Any usage that violates this assumption will result in non-deterministic behavior.

The iterators returned by this class are not fail-fast: If the deque is modified at any time after the iterator is created, the iterator will be in an unknown state. Thus, in the face of concurrent modification, the iterator risks arbitrary, non-deterministic behavior at an undetermined time in the future.

作者:

ben.manes@gmail.com (Ben Manes)

另请参阅:

http://code.google.com/p/concurrentlinkedhashmap/

构造器概要

构造器

构造器和说明
LinkedDeque()

方法概要

限定符和类型	方法和说明
boolean	add(E e)
void	addFirst(E e)
void	addLast(E e)
void	clear()
boolean	contains(Object o)
Iterator<E>	descendingIterator()
E	element()
E	getFirst()
E	getLast()
boolean	isEmpty()
Iterator<E>	iterator()
void	moveToBack(E e) Moves the element to the back of the deque so that it becomes the last element.
void	moveToFront(E e) Moves the element to the front of the deque so that it becomes the first element.
boolean	offer(E e)
boolean	offerFirst(E e)
boolean	offerLast(E e)
E	peek()
E	peekFirst()
E	peekLast()
E	poll()
E	pollFirst()
E	pollLast()
E	pop()
void	push(E e)
E	remove()
boolean	remove(Object o)
boolean	removeAll(Collection<?> c)
E	removeFirst()
boolean	removeFirstOccurrence(Object o)
E	removeLast()
boolean	removeLastOccurrence(Object o)
int	size() Beware that, unlike in most collections, this method is NOT a constant-time operation.

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

addAll, containsAll, retainAll, toArray, toArray, toString

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

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

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

addAll, containsAll, equals, hashCode, parallelStream, removeIf, retainAll, spliterator, stream, toArray, toArray

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

forEach

构造器详细资料

LinkedDeque

public LinkedDeque()

方法详细资料

isEmpty

public boolean isEmpty()

指定者:

isEmpty 在接口中 Collection<E extends Linked<E>>

覆盖:

isEmpty 在类中 AbstractCollection<E extends Linked<E>>

size

public int size()

Beware that, unlike in most collections, this method is NOT a constant-time operation.

指定者:

size 在接口中 Collection<E extends Linked<E>>

指定者:

size 在接口中 Deque<E extends Linked<E>>

指定者:

size 在类中 AbstractCollection<E extends Linked<E>>

clear

public void clear()

指定者:

clear 在接口中 Collection<E extends Linked<E>>

覆盖:

clear 在类中 AbstractCollection<E extends Linked<E>>

contains

public boolean contains(Object o)

指定者:

contains 在接口中 Collection<E extends Linked<E>>

指定者:

contains 在接口中 Deque<E extends Linked<E>>

覆盖:

contains 在类中 AbstractCollection<E extends Linked<E>>

moveToFront

public void moveToFront(E e)

Moves the element to the front of the deque so that it becomes the first element.

参数:

e - the linked element

moveToBack

public void moveToBack(E e)

Moves the element to the back of the deque so that it becomes the last element.

参数:

e - the linked element

peek

public E peek()

指定者:

peek 在接口中 Deque<E extends Linked<E>>

指定者:

peek 在接口中 Queue<E extends Linked<E>>

peekFirst

public E peekFirst()

指定者:

peekFirst 在接口中 Deque<E extends Linked<E>>

peekLast

public E peekLast()

指定者:

peekLast 在接口中 Deque<E extends Linked<E>>

getFirst

public E getFirst()

指定者:

getFirst 在接口中 Deque<E extends Linked<E>>

getLast

public E getLast()

指定者:

getLast 在接口中 Deque<E extends Linked<E>>

element

public E element()

指定者:

element 在接口中 Deque<E extends Linked<E>>

指定者:

element 在接口中 Queue<E extends Linked<E>>

offer

public boolean offer(E e)

指定者:

offer 在接口中 Deque<E extends Linked<E>>

指定者:

offer 在接口中 Queue<E extends Linked<E>>

offerFirst

public boolean offerFirst(E e)

指定者:

offerFirst 在接口中 Deque<E extends Linked<E>>

offerLast

public boolean offerLast(E e)

指定者:

offerLast 在接口中 Deque<E extends Linked<E>>

add

public boolean add(E e)

指定者:

add 在接口中 Collection<E extends Linked<E>>

指定者:

add 在接口中 Deque<E extends Linked<E>>

指定者:

add 在接口中 Queue<E extends Linked<E>>

覆盖:

add 在类中 AbstractCollection<E extends Linked<E>>

addFirst

public void addFirst(E e)

指定者:

addFirst 在接口中 Deque<E extends Linked<E>>

addLast

public void addLast(E e)

指定者:

addLast 在接口中 Deque<E extends Linked<E>>

poll

public E poll()

指定者:

poll 在接口中 Deque<E extends Linked<E>>

指定者:

poll 在接口中 Queue<E extends Linked<E>>

pollFirst

public E pollFirst()

指定者:

pollFirst 在接口中 Deque<E extends Linked<E>>

pollLast

public E pollLast()

指定者:

pollLast 在接口中 Deque<E extends Linked<E>>

remove

public E remove()

指定者:

remove 在接口中 Deque<E extends Linked<E>>

指定者:

remove 在接口中 Queue<E extends Linked<E>>

remove

public boolean remove(Object o)

指定者:

remove 在接口中 Collection<E extends Linked<E>>

指定者:

remove 在接口中 Deque<E extends Linked<E>>

覆盖:

remove 在类中 AbstractCollection<E extends Linked<E>>

removeFirst

public E removeFirst()

指定者:

removeFirst 在接口中 Deque<E extends Linked<E>>

removeFirstOccurrence

public boolean removeFirstOccurrence(Object o)

指定者:

removeFirstOccurrence 在接口中 Deque<E extends Linked<E>>

removeLast

public E removeLast()

指定者:

removeLast 在接口中 Deque<E extends Linked<E>>

removeLastOccurrence

public boolean removeLastOccurrence(Object o)

指定者:

removeLastOccurrence 在接口中 Deque<E extends Linked<E>>

removeAll

public boolean removeAll(Collection<?> c)

指定者:

removeAll 在接口中 Collection<E extends Linked<E>>

覆盖:

removeAll 在类中 AbstractCollection<E extends Linked<E>>

push

public void push(E e)

指定者:

push 在接口中 Deque<E extends Linked<E>>

pop

public E pop()

指定者:

pop 在接口中 Deque<E extends Linked<E>>

iterator

public Iterator<E> iterator()

指定者:

iterator 在接口中 Iterable<E extends Linked<E>>

指定者:

iterator 在接口中 Collection<E extends Linked<E>>

指定者:

iterator 在接口中 Deque<E extends Linked<E>>

指定者:

iterator 在类中 AbstractCollection<E extends Linked<E>>

descendingIterator

public Iterator<E> descendingIterator()

指定者:

descendingIterator 在接口中 Deque<E extends Linked<E>>