com.github.netty.core.util

类 ConcurrentLinkedHashMap.LinkedDeque<E extends ConcurrentLinkedHashMap.Linked<E>>

java.lang.Object

java.util.AbstractCollection<E>

com.github.netty.core.util.ConcurrentLinkedHashMap.LinkedDeque<E>

类型参数:

E - the type of elements held in this collection

所有已实现的接口:

Iterable<E>, Collection<E>

封闭类:

ConcurrentLinkedHashMap<K,V>

public static final class ConcurrentLinkedHashMap.LinkedDeque<E extends ConcurrentLinkedHashMap.Linked<E>>
extends AbstractCollection<E>

Linked list implementation of the the JDK6 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 ConcurrentLinkedHashMap.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()

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

addAll, containsAll, retainAll, toArray, toArray, toString

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

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

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

equals, hashCode, parallelStream, removeIf, spliterator, stream

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

forEach

构造器详细资料

LinkedDeque

public LinkedDeque()

方法详细资料

isEmpty

public boolean isEmpty()

指定者:

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

覆盖:

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

size

public int size()

指定者:

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

指定者:

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

clear

public void clear()

指定者:

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

覆盖:

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

contains

public boolean contains(Object o)

指定者:

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

覆盖:

contains 在类中 AbstractCollection<E extends ConcurrentLinkedHashMap.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()

peekFirst

public E peekFirst()

peekLast

public E peekLast()

getFirst

public E getFirst()

getLast

public E getLast()

element

public E element()

offer

public boolean offer(E e)

offerFirst

public boolean offerFirst(E e)

offerLast

public boolean offerLast(E e)

add

public boolean add(E e)

指定者:

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

覆盖:

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

addFirst

public void addFirst(E e)

addLast

public void addLast(E e)

poll

public E poll()

pollFirst

public E pollFirst()

pollLast

public E pollLast()

remove

public E remove()

remove

public boolean remove(Object o)

指定者:

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

覆盖:

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

removeFirst

public E removeFirst()

removeFirstOccurrence

public boolean removeFirstOccurrence(Object o)

removeLast

public E removeLast()

removeLastOccurrence

public boolean removeLastOccurrence(Object o)

removeAll

public boolean removeAll(Collection<?> c)

指定者:

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

覆盖:

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

push

public void push(E e)

pop

public E pop()

iterator

public Iterator<E> iterator()

指定者:

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

指定者:

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

指定者:

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

descendingIterator

public Iterator<E> descendingIterator()