public class FastCountingDeque<E> extends ForwardingDeque<E> implements Deque<E>
Deque implementing a fast counting strategy by updating its count after applying modificationsdelegate| Constructor and Description |
|---|
FastCountingDeque(Deque<E> delegate) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E e) |
boolean |
addAll(Collection<? extends E> c) |
void |
addFirst(E e) |
void |
addLast(E e) |
void |
clear() |
boolean |
contains(Object o) |
boolean |
containsAll(Collection<?> c) |
protected void |
decrement() |
Iterator<E> |
descendingIterator() |
E |
element() |
E |
getFirst() |
E |
getLast() |
protected void |
increment() |
boolean |
isEmpty() |
Iterator<E> |
iterator() |
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) |
boolean |
removeIf(Predicate<? super E> filter) |
E |
removeLast() |
boolean |
removeLastOccurrence(Object o) |
boolean |
retainAll(Collection<?> c) |
int |
size() |
Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
equals, forEach, hashCode, parallelStream, spliterator, streamclone, finalize, getClass, notify, notifyAll, toString, wait, wait, waitequals, hashCode, parallelStream, spliterator, streampublic void addFirst(E e)
public void addLast(E e)
public boolean offerFirst(E e)
offerFirst in interface Deque<E>offerFirst in class ForwardingDeque<E>public boolean offerLast(E e)
public E removeFirst()
removeFirst in interface Deque<E>removeFirst in class ForwardingDeque<E>public E removeLast()
removeLast in interface Deque<E>removeLast in class ForwardingDeque<E>public E pollFirst()
public E pollLast()
public E getFirst()
public E getLast()
public E peekFirst()
public E peekLast()
public boolean removeFirstOccurrence(Object o)
removeFirstOccurrence in interface Deque<E>removeFirstOccurrence in class ForwardingDeque<E>public boolean removeLastOccurrence(Object o)
removeLastOccurrence in interface Deque<E>removeLastOccurrence in class ForwardingDeque<E>public boolean add(E e)
public boolean offer(E e)
public E remove()
public E poll()
public E element()
public E peek()
public void push(E e)
public E pop()
public boolean remove(Object o)
remove in interface Collection<E>remove in interface Deque<E>remove in class ForwardingDeque<E>public boolean contains(Object o)
contains in interface Collection<E>contains in interface Deque<E>contains in class ForwardingDeque<E>public int size()
size in interface Collection<E>size in interface Deque<E>size in class ForwardingDeque<E>public Iterator<E> descendingIterator()
descendingIterator in interface Deque<E>descendingIterator in class ForwardingDeque<E>public boolean isEmpty()
isEmpty in interface Collection<E>isEmpty in class ForwardingDeque<E>public Object[] toArray()
toArray in interface Collection<E>toArray in class ForwardingDeque<E>public <T> T[] toArray(T[] a)
toArray in interface Collection<E>toArray in class ForwardingDeque<E>public boolean containsAll(Collection<?> c)
containsAll in interface Collection<E>containsAll in class ForwardingDeque<E>public boolean addAll(Collection<? extends E> c)
addAll in interface Collection<E>addAll in class ForwardingDeque<E>public boolean removeAll(Collection<?> c)
removeAll in interface Collection<E>removeAll in class ForwardingDeque<E>public boolean removeIf(Predicate<? super E> filter)
removeIf in interface Collection<E>removeIf in class ForwardingDeque<E>public boolean retainAll(Collection<?> c)
retainAll in interface Collection<E>retainAll in class ForwardingDeque<E>public void clear()
clear in interface Collection<E>clear in class ForwardingDeque<E>protected void increment()
protected void decrement()
Copyright © 2017 lettuce.io. All rights reserved.